Content deleted Content added
Line 26:
| '''residual graph''': ||The set of all residual edges forms the residual graph.
|-
| '''legal labelling''': ||For each residual edge <math>(u,v), \mathrm{height}(u) \leq \mathrm{height}(v) +1 </math>. We only ''push'' from ''u'' to ''v'' if <math>\mathrm{height}(u) = \mathrm{height}(v)+1</math>.
|-
| '''excess(u)''':|| Sum of flow to and from ''u''.
| |||