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

Question

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

Answer 1

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