Practice
Learn
← Quit
0 / 0 correct
Algorithms
Hard
1 of 40
What does Floyd-Warshall compute, and at what cost?
A
Max flow in O(V^2)
B
Minimum spanning tree in O(E log V)
C
Single-source shortest paths in O(E)
D
All-pairs shortest paths in O(V^3), handling negative edges (but not negative cycles)