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