Programming, Python, Facebook, Algorithms, Floyd Warshall.
all-pairs shortest path problem in a weighted graph. It is unique because it can handle negative edge weights and graphs with cycles. The algorithm works by constructing a matrix of the shortest distances between all pairs of vertices in the graph. The algorithm has advantages such as being easy to