Algorithms and Data Structures · Senior · Question 52 of 75
Which algorithm finds the maximum flow in a network?
- ✓Correct answer: Edmonds-Karp (Ford-Fulkerson with BFS)
- 2Floyd's tortoise and hare cycle check
- 3Kruskal's minimum spanning tree
Explanation
It repeatedly finds a shortest augmenting path with BFS and pushes flow along it, in O(V × E²). Max flow also solves bipartite matching, for example assigning tasks to workers.