Edmonds–Karp algorithm: Difference between revisions

Revision as of 16:40, 31 July 2006

Revision as of 16:42, 31 July 2006

Line 3:

==Algorithm==

The algorithm is identical to the [[Ford-Fulkerson algorithm]], except that the search order when finding the augmenting path is defined. The path found must be the shortest path which has available capacity. This can be found by a [[breadth-first search]], as we let edges have unit length.

<!--