Revision as of 16:40, 26 November 2013 edit Drrilll (talk \| contribs) 95 edits →Algorithm ← Previous edit		Revision as of 16:43, 26 November 2013 edit undo Drrilll (talk \| contribs) 95 edits →Push–relabel algorithm Next edit →
Line 78: ## a legal relabel. Executing these two functions in any order, so long as there remains any active vertices results in termination of the algorithm in a maximum flow. The running time for these algorithms when not observing any order to the Push and Relabel operations is <math>O(V^2 E)</math> (argument omitted). The bottleneck is the number of non-saturating pushes. ==Relabel-to-Front Algorithm (FIFO heuristic)==

Push–relabel maximum flow algorithm: Difference between revisions