๐Ÿ“Š Design and Analysis of Algorithms
Q. 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
๐Ÿ’ฌ Discuss
โœ… Correct Answer: (D) ford-fulkerson algorithm

Explanation: ford-fulkerson algorithm is used to compute the maximum feasible flow between a source and a sink in a network.


Explanation by: Mr. Dubey
ford-fulkerson algorithm is used to compute the maximum feasible flow between a source and a sink in a network.

๐Ÿ’ฌ Discussion

๐Ÿ“Š Question Analytics

๐Ÿ‘๏ธ
173
Total Visits
๐Ÿ“ฝ๏ธ
2 y ago
Published
๐ŸŽ–๏ธ
Mr. Dubey
Publisher
๐Ÿ“ˆ
96%
Success Rate