Practice
Learn
← Quit
0 / 0 correct
Algorithms
Hard
1 of 10
What does the Ford-Fulkerson method (e.g. Edmonds-Karp) compute?
A
Shortest paths
B
Minimum spanning trees
C
Maximum flow in a network, by repeatedly finding augmenting paths in the residual graph
D
Topological orders