stylistic:style_transfer, information:classification
Integer flow example

The following example shows the first steps of Ford–Fulkerson in a flow network with 4 nodes, source A {\displaystyle A} and sink D {\displaystyle D}. This example shows the worst-case behaviour of the algorithm. In each step, only a flow of 1 {\displaystyle 1} is sent across the network. If breadth-first-search were used instead, only two steps would be needed.