πŸ“Š Design and Analysis of Algorithms
Q. Does Ford- Fulkerson algorithm use the idea of?
  • (A) naïve greedy algorithm approach
  • (B) residual graphs
  • (C) minimum cut
  • (D) minimum spanning tree
πŸ’¬ Discuss
βœ… Correct Answer: (B) residual graphs

Explanation: ford-fulkerson algorithm uses the idea of residual graphs which is an extension of naïve greedy approach allowing undo operations.


Explanation by: Mr. Dubey
ford-fulkerson algorithm uses the idea of residual graphs which is an extension of naïve greedy approach allowing undo operations.

πŸ’¬ Discussion

πŸ“Š Question Analytics

πŸ‘οΈ
388
Total Visits
πŸ“½οΈ
3 y ago
Published
πŸŽ–οΈ
Mr. Dubey
Publisher
πŸ“ˆ
81%
Success Rate