Design and Analysis of Algorithms

All Pair Shortest Path Algorithm

(Floyd Warshall’s Algorithm)

Dr. D. P. Acharjya
Professor, SCOPE
SJT Annex: 201E
debiprasannaacharjya@vit.ac.in
3/9/2024 Dr. D. P. Acharjya 1
All Pair Shortest Path
 Dijkstra’s single source shortest path can also
compute all pair shortest path in a weighted
graph.

 The drawback of Dijkstra’s algorithm is that, it

never work for negative weights.

 To overcome this, the concept of Floyd

Warshall’s algorithm is presented.
3/9/2024 Dr. D. P. Acharjya 2
Floyd Warshall Algorithm
 Suppose that G(V, E) be a graph. Let W be the
adjacency matrix of the weighted directed
graph G.

 It works for negative weights.

 But the limitation is that, it fails for negative

weight cycles.
3/9/2024 Dr. D. P. Acharjya 3
Floyd Warshall Algorithm

Where D(n)=(dij(n)); Computing Time is : (n3)

3/9/2024 Dr. D. P. Acharjya 4
Numerical Illustration
 Consider the graph
 The adjacency matrix W in
terms of b, a, c, e, d

 d=

3/9/2024 Dr. D. P. Acharjya 5

3/9/2024 Dr. D. P. Acharjya 6
3/9/2024 Dr. D. P. Acharjya 7
3/9/2024 Dr. D. P. Acharjya 8
3/9/2024 Dr. D. P. Acharjya 9
3/9/2024 Dr. D. P. Acharjya 10
3/9/2024 Dr. D. P. Acharjya 11
3/9/2024 Dr. D. P. Acharjya 12
3/9/2024 Dr. D. P. Acharjya 13
3/9/2024 Dr. D. P. Acharjya 14
3/9/2024 Dr. D. P. Acharjya 15
3/9/2024 Dr. D. P. Acharjya 16
Practice Problems
 Use Floyd-Warshall’s algorithm to compute the shortest
path between all pairs of vertices. Show each iteration in
your computation.

3/9/2024 Dr. D. P. Acharjya 17