Edmonds-Karp Algorithm

• Use a shortest augmenting path (via Breadth First Search in residual graph)

• Time: O(n m2)

Previous slide

Next slide

Back to first slide

View graphic version