The Floyd-Warshall algorithm, named after its creators Robert Floyd and Stephen Warshall.
The Floyd-Warshall algorithm is used for finding the shortest paths between all pairs of vertices in a weighted, directed and undirected graph.
• It works for graphs with both positive and negative edge weights, as long as there are no negative cycles.
Applications:
Here is a list of applications of Floyd Warshall Algorithm:
- Shortest Path Queries
- Routing Protocols
- Network Design
- Airline Industry
- Robotics