Push–relabel maximum flow algorithm: Difference between revisions

Content deleted Content added
m Relabel: rewrite terms so that they match the definition of a residual
Clarified what s and t are
Line 17:
 
Let:
*{{math|''G'' {{=}} (''V'', ''E'')}} be a ''network'' with ''capacity function'' {{math|''c'': ''V'' × ''V'' → ℝ<sub>∞</sub>}}, ''source'' {{math|''s'' ∈ ''V''}} and ''sink'' {{math|''t'' ∈ ''V''}}
*{{math|''F'' {{=}} (''G'', ''c'', ''s'', ''t'')}} a ''flow network'',
*{{math|''f'' : ''V'' × ''V'' → ℝ}} denote a ''pre-flow'' in {{mvar|F}} (defined below),
*{{math|''x''<sub>''f''</sub> : ''V'' → ℝ}} denote the ''excess'' function with respect to the flow {{mvar|f}}, defined by {{math|''x''<sub>''f''</sub> (''u'') {{=}} ∑<sub>''v'' ∈ ''V''</sub> ''f'' (''v'', ''u'')}},