Augmenting Path Algorithm
G:
0
10
s
0
10
2
0
4
2 0
0
8
3
0
9
flow
4
6 0
0
10
5
0
10
capacity
t
Flow value = 0
1
Augmenting Path Algorithm
G:
8 X
0
10
s
0
10
2
0
4
2 0
0 8
X
8
3
0
9
flow
4
6 0
5
0
10
8 X
0
10
capacity
t
Flow value = 0
2
4
4
residual
capacity
G f:
10
s
10
2
8
6
10
3
9
5
10
t
2
Augmenting Path Algorithm
2
G:
10 X
8
10
0
10
s
2 X
0
2
3
0
4
8
8
0 2
X
9
4
6 0
5
0
10
10 X
8
10
t
Flow value = 8
2
4
4
2
2
8
6
10
10
3
9
5
2
8
G f:
s
t
8
3
Augmenting Path Algorithm
G:
10
10
s
0 6
X
10
2
0
4
2 2
8
8
3
2 8
X
9
4
6X
0
6
5
0 6
X
10
10
10
t
Flow value = 10
2
4
4
10
2
8
6
10
10
3
7
5
10
G f:
s
t
2
4
Augmenting Path Algorithm
2
G:
10
10
s
6 8
X
10
2 X
2
0
3
0 2
X
4
8
8
8
9
4
6 6
6 8
X
10
5
10
10
t
Flow value = 16
2
4
4
G f:
6
s
10
2
8
6
4
4
3
1
5
10
6
t
8
5
Augmenting Path Algorithm
G:
10
10
s
8 9
X
10
2
2 3
X
4
2 0
8 7
X
8
3
8 9
X
9
4
6 6
8 9
X
10
5
10
10
t
Flow value = 18
2
2
2
4
G f:
8
s
10
2
8
6
2
2
3
1
5
10
8
t
8
6
Augmenting Path Algorithm
G:
10
10
s
9
10
2
3
4
2 0
7
8
3
9
9
4
6 6
9
10
5
10
10
Cut value = 19
t
Flow value = 19
3
2
G f:
s
4
1
10
2
7
1
3
9
1
9
6
1
5
10
t
9
7