Revision as of 10:43, 7 December 2009 edit Andreas Kaufmann (talk \| contribs) Extended confirmed users, Pending changes reviewers 7,180 edits m Quick-adding category Graph algorithms (using HotCat) ← Previous edit		Revision as of 06:02, 9 December 2009 edit undo 210.212.1.35 (talk) →Push Next edit →
Line 25: * <math>height(u) > height(v)</math>. Can only send to lower node. We send an amount of flow equal to <math>\min(excess(u), c(u,v)-f(u,v))</math>. yes I agree with that.. ===Relabel===

Push–relabel maximum flow algorithm: Difference between revisions