Push–relabel maximum flow algorithm: Difference between revisions

Revision as of 20:16, 26 November 2013

Revision as of 20:18, 26 November 2013

Line 64:

|}

WhenIf weall executethese theconditions are pushmet we sendcan an amount of''Push'' flow equal to <math>\min(\mathrm{excess}(u), c(u,v)-f(u,v))</math> across the edge <math>(u,v)</math>. .

===Relabel===