What is the time complexity of the Floyd-Warshall algorithm?

Approach: Analyze triple-nested loop structure.

O(V^3), where V is the number of vertices. It finds shortest paths between all pairs of vertices in a weighted graph.

Follow-up: Can it handle negative edge weights?

Key concepts: all-pairs shortest path, dynamic programming.