Multiple ChoiceHard 30s
Floyd-Warshall Algorithm
Floyd-Warshall computes:
Options
- 1Single-source shortest path in O(V+E)
- 2All-pairs shortest paths in O(V³)
- 3Minimum spanning tree in O(E log V)
- 4Maximum network flow in O(V²·E)
Think you can answer under pressure?
Get matched and answer live questions in 3-minute 1v1 battles. Elo ranking, badge tiers and bragging rights on the line.