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

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

Solution

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

How to name algorithm in c++ for process items in collection which can add or remove items?
Add or Sum of hours like 13:30+00:00:20=13:30:20 but how?
Generate words that fit in Guids (just for fun)
Efficient calculation of Fibonacci series
What is the best algorithm for overriding GetHashCode?
Picking a random element from a set
How to generate combinations in chunks
How do I check if an array includes a value in JavaScript?
Why is O(n) better than O( nlog(n) )?
Geometric series: calculate quotient and number of elements from sum and first & last element
Algorithm to find all the exact divisors of a given integer
Fastest way to generate binomial coefficients
Enumerate all full (labeled) binary tree
What's the best way to write `indexBy` in Scala?
In Dijkstra's algorithm why must it first expand nodes with the current least cost?
Distance between every Vertices in Graph
Design an efficient algorithm to sort 5 distinct keys in fewer than 8 comparisons
Is there any easy way to do modulus of 2³² - 1 operation?
Difference between Big-O and Little-O Notation
Solving a simultaneous equation through code
Number of paths using k coins
Infix to postfix algorithm that takes care of unary operators
What would cause an algorithm to have O(log log n) complexity?
Algorithm to create a singly linked list
Why does cache use Most Recently Used (MRU) algorithm as evict policy?
How to check if a number is a power of 2
How to define a normal Markov algorithm (NMA) to swap two ternary numbers separated by the symbol "^"?
Enumerating all paths in a directed acyclic graph
Segmented Sieve of Eratosthenes?
what is the output of this simple recursive function? can you explain in detail?