1

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

razshan
  • 1,128
  • 12
  • 41
  • 59

1 Answers1

1

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

Gassa
  • 8,546
  • 3
  • 29
  • 49