Push–relabel maximum flow algorithm: Difference between revisions

Content deleted Content added
WikiCleanerBot (talk | contribs)
m v2.04b - Bot T23 - WP:WCW project (Duplicated reference)
Relabel: more succint
Line 61:
 
relabel(u):
assert x<sub>f</sub>[u] > 0 and 𝓁[u] <= 𝓁[v] for all v such that c[u][v] - <sub>f</sub>[u][v] > 0
𝓁[u] = 1 + min(𝓁[v] for all v such that c[u][v] - <sub>f</sub>[u][v] > 0) + 1
 
====Effects of push and relabel====