Revision as of 16:44, 26 November 2013 edit Drrilll (talk \| contribs) 95 edits →Push ← Previous edit		Revision as of 16:46, 26 November 2013 edit undo Drrilll (talk \| contribs) 95 edits →Relabel-to-Front Next edit →
Line 114: ### 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. ~~Not~~Note that after step 1 there is no path from ''s'' to ''t'' in the residual graph. ==Sample implementation==

Push–relabel maximum flow algorithm: Difference between revisions