Revision as of 20:40, 25 November 2013 edit Drrilll (talk \| contribs) 95 edits →Relabel ← Previous edit		Revision as of 20:41, 25 November 2013 edit undo Drrilll (talk \| contribs) 95 edits →Relabel-to-Front Next edit →
Line 88: ### Restart the traversal from the element following ''u'' in ''L''. The running time for ''relabel-to-front'' is <math>O(V^3)</math> (proof omitted). Again the bottleneck is non-saturating pushes, but we have reduced the number. ==Sample implementation==

Push–relabel maximum flow algorithm: Difference between revisions