- Dijkstra’s Algorithm is one example of a single-source shortest or SSSP algorithm, i.e., given a source vertex it finds shortest path from source to all other vertices.
- Floyd Warshall Algorithm is an example of all-pairs shortest path algorithm, meaning it computes the shortest path between all pair of nodes.
Time Complexities :
- Time Complexity of Dijkstra’s Algorithm: O(E log V)
- Time Complexity of Floyd Warshall: O(V3)
- We can use Dijskstra’s shortest path algorithm for finding all pair shortest paths by running it for every vertex. But time complexity of this would be O(VE Log V) which can go (V3 Log V) in worst case.
- Another important differentiating factor between the algorithms is their working towards distributed systems. Unlike Dijkstra’s algorithm, Floyd Warshall can be implemented in a distributed system, making it suitable for data structures such as Graph of Graphs (Used in Maps).
- Lastly Floyd Warshall works for negative edge but no negative cycle, whereas Dijkstra’s algorithm don’t work for negative edges.
This article is contributed by Vineet Joshi. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
- What are the differences between Bellman Ford's and Dijkstra's algorithms?
- Why Prim’s and Kruskal's MST algorithm fails for Directed Graph?
- D'Esopo-Pape Algorithm : Single Source Shortest Path
- Count ways to change direction of edges such that graph becomes acyclic
- Check if a Tree can be split into K equal connected components
- Minimum value of distance of farthest node in a Graph
- Minimum number of colors required to color a graph
- Shortest Path Faster Algorithm
- Check whether the cost of going from any node to any other node via all possible paths is same
- Check if alternate path exists from U to V with smaller individual weight in a given Graph
- Maximum number of edges that N-vertex graph can have such that graph is Triangle free | Mantel's Theorem
- Shortest path in a graph from a source S to destination D with exactly K edges for multiple Queries
- Convert Adjacency Matrix to Adjacency List representation of Graph
- Build a segment tree for N-ary rooted tree