algorithms

Figure 7.6 The max-flow algorithm applied to the network of Figure 7.4. At each iteration,
the current flow is shown on the left and the residual network on the right. The paths chosen
are shown in bold.
Current flow
Residual graph
(a)
a
d
a
2
d
3
10 1
2
s
b
t
s
3
b
1
1
t
4
5
c
e
c
5
e
(b)
1
a
1
d
1
2
a
10 1
1
1
d
2
s
b
1
t
s
3
b
1 1
t
c
1
e
1
4
c
1
4
e
1
4
(c)
a
2
d
a
2
d
2
2
1
10 1
2
s
b
1
1
t
s
3
b
1 1
t
c
1
e
2
4
c
1
4
e
2
3
(d)
a
2
d
a
2
d
2
2
1
10 1
2
s
b
1
1
t
s
3
b
1 1
t
3
c
4
e
5
3
1
c
4
1
e
5
204