A. Naïve greedy algorithm approach
B. Residual graphs
C. Minimum cut
D. Minimum spanning tree
This question was addressed to me in a job interview.
The query is from Flow Networks topic in chapter Flow Networks of Data Structures & Algorithms II
Easy explanation – Ford-Fulkerson algorithm uses the idea of residual graphs which is an extension of naïve greedy approach allowing undo operations.