notice how the length of the augmenting path found by the algorithm (in red) never decreases. the paths found are the shortest possible. the flow found is equal to the capacity across the minimum cut in the graph separating the source and the sink. there is only one minimal cut in this graph, partitioning the nodes into the sets formula_16 and formula_17, with the capacity