Push–relabel maximum flow algorithm: Difference between revisions

Revision as of 21:16, 25 November 2013

Revision as of 21:17, 25 November 2013

Line 31:

|}

The '''preflow''' algorithm observes the first two of the conditions of flow networks, plus a relaxed third condition for the duration of the algorithm (once the algorithm finishes once all the excess is gone from the graph, at which point we have a legal flow, and the '''Flow conservation''' constraint is again observed):

:{|