Push–relabel maximum flow algorithm: Difference between revisions

Content deleted Content added
m Fixed a grammatical error
Tag: gettingstarted edit
Kcm1700 (talk | contribs)
"Current-edge" data structure and discharge operation: `else' is necessary. Don't move to the next neighbor if F[u][v] < C[u][v]
Line 106:
if (u, v) is admissible
push(u, v)
else
let current-edge[u] point to the next neighbor of u
 
===Active vertex selection rules===