Edmonds-Karp

If implement computation of augmenting path using breadth-first search, i.e., if augmenting path is a shortest path from s to t in residual network, then the number of augmentations O(|V||E|).
- The shortest-path distance from v to t in R is non-decreasing.
- The number of times an edge (u,v) can become critical, i.e., residual capacity of (u,v) = residual capacity of augmenting path, is O(|V|).

If implement computation of augmenting path using breadth-first search, i.e., if augmenting path is a shortest path from s to t in residual network, then the number of augmentations O(|V||E|).