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

206 Views Asked by At

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

1

There are 1 best solutions below

0
On BEST ANSWER

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