![Mcqmate logo](https://mcqmate.com/images/logos/logo-black.png)
![Mcqmate logo](https://mcqmate.com/images/logos/logo-white.png)
McqMate
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 |
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. |
View all MCQs in
Design and Analysis of AlgorithmsNo comments yet