Algorithm Design by Éva Tardos and Jon Kleinberg Copyright © 2005 Addison Wesley Slides by Kevin Wayne 7. Edmonds-karp Demo

2 Max-Flow Instance s t G: Flow value = 0 0 flow capacity

3 Edmonds-Karp Algorithm s t G: s t G f : X X 0 Flow value = 0 capacity residual capacity flow X

4 Edmonds-Karp Algorithm s t G: s t G f : Flow value = X X X 4 4 4

5 Edmonds-Karp Algorithm s t G: s t G f : Flow value = X X X

6 Edmonds-Karp Algorithm s t G: s t 1 2 G f : Flow value = X X X X 6 5 9

7 Edmonds-Karp Algorithm s t G: s t 1 2 G f : Flow value = Cut capacity = 19 10