Revision as of 15:22, 10 April 2014 edit Kxx (talk \| contribs) Extended confirmed users 3,386 edits →References ← Previous edit		Revision as of 15:32, 10 April 2014 edit undo Kxx (talk \| contribs) Extended confirmed users 3,386 edits m →Definitions: {{seealso}} Next edit →
Line 19: ==Definitions== {{~~main~~seealso\|Flow network}} The push-relabel algorithm finds maximum flow on a [[flow network]]. There are three conditions for a flow network:

Push–relabel maximum flow algorithm: Difference between revisions