How does Edmonds-karp algorithm actually computes the shortest path?

StackOverflow https://stackoverflow.com/questions/22831862

Frage

I am trying to understand Edmonds-Karp algorithm in more details and was curious to know what algorithm it uses to compute the shortest path (least number of edges) from s to t for each iteration

War es hilfreich?

Lösung

Breadth-first search. You might want to read the Wikipedia entry for details.

Lizenziert unter: CC-BY-SA mit Zuschreibung
Nicht verbunden mit StackOverflow
scroll top