Which of the following algorithms can be used to find the maximum flow in a flow network? a) Kruskal's algorithm b) Dijkstra's algorithm c) Bellman-Ford algorithm d) Ford-Fulkerson algorithm
Which of the following algorithms can be used to find the maximum flow in a flow network? a) Kruskal's algorithm b) Dijkstra's algorithm c) Bellman-Ford algorithm d) Ford-Fulkerson algorithm
Share
Answer: d) Ford-Fulkerson algorithm