Push–relabel maximum flow algorithm: Difference between revisions

Revision as of 13:07, 27 November 2013

Revision as of 13:08, 27 November 2013

Line 126:

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

for each edgevertex (s,v) incident to s:

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

L = v - {''s'',''t''}; //build a list of all vertices in any order

current = L.head;