Push–relabel maximum flow algorithm: Difference between revisions

Revision as of 16:46, 26 November 2013

Revision as of 20:16, 26 November 2013

Line 61:

| <math>r(u,v) > 0</math> || There is a residual edge <math>r(u,v)</math> from ''u'' to ''v'', where <math>r(u,v) = c(u,v) - f(u,v)</math>

|-

| <math>\mathrm{height}(u) = \mathrm{height}(v)+1</math> || We have a legal labelling of ''u'' andis higher than ''v''.

|}