next up previous
Next: Up: Previous:

Analysis:

Depends on method for finding augmenting path.

Use breadth-first search (Edmonds-Karp Algorithm). Thus, the augmenting path is shortest from s to t.



Theorem 26.9

The total number of augmentations is O(VE), O(E) per augmentation. Thus the algorithm has run time O(VE2).



Push-Relabel method yields O(V2E) (Section 26.4), and
Relabel-to-Front method yields O(
V3) (Section 26.5).


next up previous
Next: Up: Previous: