**Floyd-Warshall Algorithm**

- Floyd-Warshall Algorithm is an algorithm for solving All Pairs
**Shortest path problem**which gives the shortest path between every pair of vertices of the given graph. - Floyd-Warshall Algorithm is an example of dynamic programming.
- The main advantage of Floyd-Warshall Algorithm is that it is extremely simple and easy to implement.