Push–relabel maximum flow algorithm: Difference between revisions

Revision as of 16:19, 27 November 2013

Revision as of 04:03, 7 December 2013

Line 29:

:{|

| '''Non-negativity constraint: ''' <math>\ \sum_vsum_{w \in V} f(v,u, w) = \mathrm{excess}(u) \geq 0</math> for all nodes <math>u \neq s</math>. More flow enters a node than exits.

|}