Index
Help
1
1
2
3
-1
4
1
0
2
0
3
0
4
0
for
v
in
G.vertices:
if
excess(v) < 0:
D.Push(v)
while
D.IsNotEmpty():
t = D.Pop()
ShortestPathDist()
(s,P) = FindShortestPath(t)
delta = min(excess(s), - excess(t),MinResCap(P))
IncreaseFlow(P,delta)
LiftVertices(dist)
if
excess(t) < 0:
D.Push(t)