Revision as of 20:38, 25 November 2013 edit Drrilll (talk \| contribs) 95 edits →Push–relabel algorithm ← Previous edit		Revision as of 20:39, 25 November 2013 edit undo Drrilll (talk \| contribs) 95 edits →Push Next edit →
Line 37: * <math>\mathrm{excess}(u) > 0</math>. More flow into the node than out of it so far. * <math>c(u,v) - f(u,v) > 0</math>. Available capacity from ''u'' to ''v''. * <math>\mathrm{height}(u) >= \mathrm{height}(v)+1</math>. Can only send to lower node. We send an amount of flow equal to <math>\min(\mathrm{excess}(u), c(u,v)-f(u,v))</math>.

Push–relabel maximum flow algorithm: Difference between revisions