7.

Ford-Fulkerson Demo

Algorithm Design by Éva Tardos and Jon Kleinberg • Copyright © 2005 Addison Wesley • Slides by Kevin Wayne
 Ford-Fulkerson Algorithm

0
flow
2 4 4
capacity
G: 0 0 0
10 2 0 8 60 10

0 0 0
s 10 3 9 5 10 t

Flow value = 0

2
 Ford-Fulkerson Algorithm

0
flow
2 4 4
capacity
G: 8 X
0 0 8
X 0
10 2 0 8 60 10

0 0 8 X
0
s 10 3 9 5 10 t 8

Flow value = 0

2 4 4
residual capacity
Gf:
10 2 8 6 10

s 10 3 9 5 10 t

3
 Ford-Fulkerson Algorithm

0
2 4 4

G: 10 X
8 8 0
10 2 X
0 8 60 10
2
0 0 2
X 10 X
8
s 10 3 9 5 10 t
10

Flow value = 8

2 4 4

Gf: 8
2 2 8 6 10

s 10 3 9 5 2 t

4
 Ford-Fulkerson Algorithm

0
2 4 4

G: 10 8 0 6
X
10 2 2 8 6X
0 10
6
0 6
X 2 8
X 10
s 10 3 9 5 10 t
16

Flow value = 10

2 4 4

Gf:
10 2 8 6 10

s 10 3 7 5 10 t

5
 Ford-Fulkerson Algorithm

0 2
X
2 4 4

G: 10 8 6 8
X
10 2 X
2 8 66 10
0
6 8
X 8 10
18
s 10 3 9 5 10 t

Flow value = 16

2 4 4

Gf: 6
10 2 8 6 4

s 4 3 1 5 10 t
6 8

6
 Ford-Fulkerson Algorithm

2 3
X
2 4 4

G: 10 8 7
X 8 9
X
10 2 0 8 66 10

8 9
X 8 9
X 10
s 10 3 9 5 10 t 19

Flow value = 18

2
2 2 4

Gf: 8
10 2 8 6 2

s 2 3 1 5 10 t
8 8

7
 Ford-Fulkerson Algorithm

3
2 4 4

G: 10 7 9
10 2 0 8 66 10

9 9 10
s 10 3 9 5 10 t

Flow value = 19

3
2 1 4

Gf: 9
1
10 2 7 6 1

s 1 3 9 5 10 t
9

8
 Ford-Fulkerson Algorithm

3
2 4 4

G: 10 7 9
10 2 0 8 66 10

9 9 10
s 10 3 9 5 10 t

Cut capacity = 19 Flow value = 19

3
2 1 4

Gf: 9
1
10 2 7 6 1

s 1 3 9 5 10 t
9