1. Augmenting Path Algorithm
flow 2 4 4 G:
capacity 10 8 6 2 10 s 10 3 9 5 10 t
Flow value = 0

2. Augmenting Path Algorithm
flow 2 4 4 G: 8 X
capacity 10 8 6 2 10 s 10 3 9 5 10 t
Flow value = 0 2 4 4
residual capacity
Gf: 10 8 6 2 10 s 10 3 9 5 10 t

3. Augmenting Path Algorithm2 4 4 G: 10 2 X 8 8 10 8 6 2 10 8 s 10 3 9 5 10 t
Flow value = 8 2 4 4
Gf: 8 2 8 6 2 10 s 10 3 9 5 2 t 8

4. Augmenting Path Algorithm2 4 4 G: X 6 8 10 8 10 8 6 2 10 2 2 10 s 10 3 9 5 10 t
Flow value = 10 2 4 4
Gf: 10 8 6 2 10 s 10 3 7 5 10 t 2

5. Augmenting Path AlgorithmX 8 2 2 4 4 G: 10 8 6 10 8 6 6 2 10 2 6 8 10 s 10 3 9 5 10 t
Flow value = 16 2 4 4
Gf: 6 10 8 6 2 4 s 4 3 1 5 10 t 6 8

6. Augmenting Path AlgorithmX 9 7 3 2 2 4 4 G: 10 8 8 10 8 6 6 2 10 8 8 10 s 10 3 9 5 10 t
Flow value = 18 2 2 2 4
Gf: 8 10 8 6 2 2 s 2 3 1 5 10 t 8 8

7. Augmenting Path Algorithm3 2 4 4 G: 10 7 9 10 8 6 6 2 10
Cut value = 19 9 9 10 s 10 3 9 5 10 t
Flow value = 19 3 2 1 4
Gf: 9 1 10 7 6 2 1 s 1 3 9 5 10 t 9