Push–relabel maximum flow algorithm: Difference between revisions

Revision as of 02:20, 18 April 2014

Revision as of 04:19, 18 April 2014

Line 73:

After initialization, the algorithm repeatedly executes an applicable push or relabel operation until no such operations apply, at which point the preflow has been converted into a maximum flow.

generic-push–relabelpush-relabel(G(V, E), s, t):

create a preflow f that saturates all out-edges of s

let h[u] = 0 ∀v ∈ V