=> Running time of Edmonds-Karp is O(m2n)
Corollary 1: An edge (v,w) can be saturated at most O(n) times.
Corollary 2: The total # of flow augmentations performed is O(mn)
Since each augmentation can be performed in O(m) time => O(m2n) time.
Can be improved to nearly O(mn) with super-fancy data structures.