Transcript demo of Edmonds-Karp algorithm

7. Edmonds-karp Demo
Algorithm Design by Éva Tardos and Jon Kleinberg • Copyright © 2005 Addison Wesley • Slides by Kevin Wayne
Max-Flow Instance
G:
0
10
s
0
10
2
0
4
2 0
0
8
3
0
9
4
60
0
10
5
0
10
flow
capacity
t
Flow value = 0
2
Edmonds-Karp Algorithm
G:
0
10
s
X
0 9
10
2
0
4
2 0
0
8
3
X
09
9
flow
capacity
4
60
0
10
5
0 9
X
10
t
Flow value = 0
2
4
4
2
8
6
10
3
9
5
10
Gf:
10
s
10
residual capacity
t
3
Edmonds-Karp Algorithm
4
G:
X
0
10
s
9
10
2
X
0
4
2 0
0
8
3
9
9
4
4
60
0
X
10
5
9
10
4
t
Flow value = 9
2
4
4
10
2
8
6
10
1
3
9
5
1
Gf:
s
9
t
9
4
Edmonds-Karp Algorithm
4 5
X
10
G:
9
10
s
4
2
4
2 0
0 1
X
8
3
9
9
4
4
60
5
10
10 9
X
10
t
Flow value = 13
2
4
4
4
Gf:
s
4
6
2
8
6
6
1
3
9
5
1
9
t
9
5
Edmonds-Karp Algorithm
4
2
4
10 X
5
G:
10
9
10
s
2 0
8
3
9
9
4
X
1
X
4
6
6X
0 5
10
9
10
5
t
10
Flow value = 14
4
2
4
5
Gf:
4
5
2
7
6
6
9
5
9
1
s
1
3
t
9
6
Edmonds-Karp Algorithm
G:
10
10
s
9
10
4
2
4
2 0
8
3
9
9
4
6
6 5
10
10
5
4
Gf:
t
10
Cut capacity = 19
2
9
Flow value = 19
4
9
10
2
2
1
9
5
5
1
6
s
1
3
9
t
9
7