Programming, Python, Facebook, Algorithms, Floyd Warshall.
Then it iteratively computes the shortest path between each pair of vertices, using the formula: distance[i][j] = min(distance[i][j], distance[i][k] + distance[k][j]) where i, j, and k are vertices in the graph, and distance[i][j] represents the shortest distance between i and j. The algorithm