Push–relabel maximum flow algorithm: Difference between revisions

Content deleted Content added
Line 57:
h[u] = min(h[v] ∀v such that f[u][v] < c[u][v]) + 1
 
====Effects of push and relabel====
After a push or relabel operation, ''h'' remains a valid height function with respect to ''f''.