Transcript demo of Dinic algorithm

7. Dinic Algorithm
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
Dinic Algorithm
G:
0
10
0
10
s
2
0
4
2 0
0
8
10
s
GL:
X1
s
5
60
3
0
9
5
0
10
2
4
4
2
8
6
10
3
9
5
10
2
4
4
10
10
9
1
3
4
t
residual capacity
8
9
9
flow
capacity
4
0
10
Gf:
10
Flow value = 0
10
5
9
X
10
10
t
4
t
3
Dinic Algorithm
G:
5
0
X 9
10
s
Gf:
X
0
10
5
s
5
s
2 0
X
0 1
8
4
60
3
5
2
4
4
5
2
1
3
9
2
3
1
X
0 4
10
10 0
X
10
6
6
5
10
t
4
t
4
5
7
5
1
Flow value = 14
9 0
X
9
7
9
GL:
2
0
X 4
4
5
6
5
5
6
t
4
Dinic Algorithm
G:
5
10 X
10
s
0
X 9
10
2
0
X 4
4
2 0
1 6
X
8
5
2
4
4
10
2
1
3
9
GL:
2
1
3
6
1
5
5
4
X 9
10
10 0
X
10
1
10
t
9
t
4
2
s
X
60
5
3
2
9
4
9 0
X
9
Gf:
s
Flow value = 19
1
5
1
t
5
Dinic Algorithm
G:
5
10 X
10
s
0
X
10
2
0
X 4
4
2 0
1 6
X
8
9
3
4
X
60
5
9 0
X
9
5
Cut capacity = 19
2
Gf:
s
4
10
2
2
1
3
9
4
X 9
10
10 0
X
10
t
Flow value = 19
4
6
1
5
5
1
10
9
t
9
6