Introduction i. Floyd-Warshall Algorithm finds shortest paths between all pairs of nodes. ii. Works on weighted, directed or undirected graphs. iii. Uses dynamic programming. iv. No negative weight cycles allowed.…