Push–relabel maximum flow algorithm: Difference between revisions

Revision as of 12:53, 27 November 2013

Revision as of 13:06, 27 November 2013

Line 125:

In the ''relabel-to-front'' algorithm we fully discharge each vertex before moving to the next one. The ordering tends to reduce the number of non-saturating pushes we do:

FunctionAlgorithm Relabel-to-Front(G(V,E),s,t):

for each edge (s,v):

push(s,v); //note that this will saturate the edge