Floyd-Warshall Algorithm
:
Computes the shortest paths between all pairs of vertices.
Time complexity: \(O(V^3)\)