Floyd-Warshall Algorithm: Shortest path between all pair of nodes

graph-algorithm
shortest-path
floyd-warshall-algorithm
(Team) #1
Floyd-Warshall Algorithm is an algorithm based on dynamic programming technique to compute the shortest path between all pair of nodes in a graph.

The credit of Floyd-Warshall Algorithm goes to Robert Floyd, Bernard Roy and Stephen Warshall.

Average case time complexity: Θ(V^3)

Space complexity: Θ(V^2)
This is a companion discussion topic for the original entry at http://iq.opengenus.org/floyd-warshall-algorithm-shortest-path-between-all-pair-of-nodes/