Which algorithm is used to solve a maximum flow problem?
(a) Prim’s algorithm
(b) Kruskal’s algorithm
(c) Dijkstra’s algorithm
(d) Ford-Fulkerson algorithm
The question was posed to me by my college director while I was bunking the class.
I'm obligated to ask this question of Flow Networks topic in section Flow Networks of Data Structures & Algorithms II