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