Revision as of 13:09, 27 November 2013 edit Drrilll (talk \| contribs) 95 edits →Relabel-to-Front ← Previous edit		Revision as of 13:09, 27 November 2013 edit undo Drrilll (talk \| contribs) 95 edits →Relabel-to-Front Next edit →
Line 128: for each vertex v incident to s: push(s,v); //note that this will saturate the edges (s,v), since the flow from s is limitless L = v - {''s'',''t''}; //build a list of all vertices in any order current = L.head; while (current != NIL):

Push–relabel maximum flow algorithm: Difference between revisions