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