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

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

题

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

有帮助吗？

解决方案

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

许可以下： CC-BY-SA 和 归因
不隶属于 StackOverflow
scroll top