80 likes | 359 Views
Augmenting Path Algorithm. flow. 0. 2. 4. 4. G:. capacity. 0. 0. 0. 6. 0. 8. 10. 10. 2. 0. 0. 0. 0. 10. s. 3. 5. t. 10. 9. Flow value = 0. Augmenting Path Algorithm. 8. X. 8. X. 8. X. flow. 0. 2. 4. 4. G:. capacity. 0. 0. 0. 6. 0. 8. 10. 10. 2.
E N D
Augmenting Path Algorithm flow 0 2 4 4 G: capacity 0 0 0 6 0 8 10 10 2 0 0 0 0 10 s 3 5 t 10 9 Flow value = 0
Augmenting Path Algorithm 8 X 8 X 8 X flow 0 2 4 4 G: capacity 0 0 0 6 0 8 10 10 2 0 0 0 0 10 s 3 5 t 10 9 Flow value = 0 2 4 4 residualcapacity Gf: 6 8 10 10 2 10 s 3 5 t 10 9
Augmenting Path Algorithm 10 X X 2 10 X 2 X 0 2 4 4 G: 0 8 8 6 0 8 10 10 2 0 0 8 0 10 s 3 5 t 10 9 Flow value = 8 2 4 4 Gf: 8 6 8 10 2 2 10 s 3 5 t 2 9 8
Augmenting Path Algorithm 6 X X 6 6 X 8 X 0 2 4 4 G: 0 10 8 6 0 8 10 10 2 2 0 10 2 10 s 3 5 t 10 9 Flow value = 10 2 4 4 Gf: 6 8 10 10 2 10 s 3 5 t 10 7 2
Augmenting Path Algorithm 2 X 8 X X 0 8 X 0 2 4 4 G: 6 10 8 6 6 8 10 10 2 2 6 10 8 10 s 3 5 t 10 9 Flow value = 16 2 4 4 Gf: 6 6 8 4 10 2 4 s 3 5 t 10 1 6 8
Augmenting Path Algorithm 3 X 9 X 7 X 9 X 9 X 2 2 4 4 G: 8 10 8 6 6 8 10 10 2 0 8 10 8 10 s 3 5 t 10 9 Flow value = 18 2 2 4 2 Gf: 8 6 8 2 10 2 2 s 3 5 t 10 1 8 8
Augmenting Path Algorithm Cut value = 19 3 2 4 4 G: 9 10 7 6 6 8 10 10 2 0 9 10 9 10 s 3 5 t 10 9 Flow value = 19 3 2 4 1 Gf: 9 1 6 7 1 10 2 1 s 3 5 t 10 9 9