Does Ford-Fulkerson algorithm use the idea of?
Naive greedy algorithm approach
Residual graphs
Minimum cut
Minimum spanning tree
(B) Residual graphs
Explanation:
Ford-Fulkerson algorithm uses the idea of residual graphs, which is an extension of the naive greedy approach allowing undo operations.
