1. 7. Ford-Fulkerson Algorithm with multiple optimal solutions

2. Ford-Fulkerson Algorithm
flow G:
capacity 2 1 1 4 s 4 3 t 1 4
Flow value = 0 1 1 5

3. Ford-Fulkerson Algorithm
flow G:
capacity 2 1 1 4 t s 3 4 1 4
Flow value = 0 1 1 5
Gf: 2 1 1 4 4 4 t s 3 1 1 1 5

4. Ford-Fulkerson Algorithm
flow G: 1
capacity 2 1 1 1 1 1 4 4 t s 3 1 4
Flow value = 1 1 1 5
Gf: 2 1 1 1 1 4 t s 3 1 3 3 1 1 5

5. Ford-Fulkerson Algorithm
flow G: 1
capacity 2 1 1 1 2 2 4 4 t s 3 1 4 1 1
Flow value = 2 1 1 5
Gf: 2 1 1 2 2 4 t s 3 1 2 2 1 1 5

6. Ford-Fulkerson Algorithm
flow G: 1
capacity 2 1 1 1 2 1 2 4 4 t s 3 1 4 1 1
Flow value = 3 1 1 5
Gf: 2 1 1 1 2 4 t s 3 1 1 2 1 1 5

7. Ford-Fulkerson Algorithm
flow G: 1
capacity 2 1 1 1 2 1 2 4 t s 3 3 1 3 1 1
Flow value = 3 1 1 5
Gf: 2 1 1 1 2 4 t s 3 1 2 1 1 5

8. Ford-Fulkerson Algorithm
flow G: 1
capacity 2 1 1 1 2 1 2 4 t s 3 3 1 3 1 1
Flow value = 3 1 1 5
Gf: 2 1 1 1 2 4 t s 3 1 2 1 1 5

9. Ford-Fulkerson Algorithm
flow G: 1
capacity 2 1 1 1 2 1 2 4 t s 3 3 1 3 1 1
Flow value = 3 1 1 5
Gf: 2 1 1 1 2 4 t s 3 1 2 1 1 5

10. Ford-Fulkerson Algorithm
flow G: 1
capacity 2 1 1 1 2 1 2 4 t s 3 3 1 3 1 1
Flow value = 3 1 1 5
Gf: 2 1 1 1 2 4 t s 3 1 2 1 1 5