Content deleted Content added
Andryandrew (talk | contribs) m Formatting |
Thomas Meng (talk | contribs) →Algorithm: I'll start filling in some details of the proof so that readers can make sense of the various properties mentioned here and why they are necessary. |
||
Line 5:
==Algorithm==
The algorithm is identical to the [[Ford–Fulkerson algorithm]], except that the search order when finding the [[Flow network#Augmenting paths|augmenting path]] is defined. The path found must be a shortest path that has available capacity. This can be found by a [[breadth-first search]], where we apply a weight of 1 to each edge. The running time of <math>O(|V||E|^2)</math> is found by showing that each augmenting path can be found in <math>O(|E|)</math> time, that every time at least one of the <math>E</math> edges becomes saturated (an edge which has the maximum possible flow), that the distance from the saturated edge to the source along the augmenting path must be longer than last time it was saturated, and that the length is at most <math>|V|</math>. Another property of this algorithm is that the length of the shortest augmenting path increases monotonically.
==Pseudocode==
| |||