# Comparison of Dijkstra’s and Floyd–Warshall algorithms

**Main Purposes: **

- 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(V
^{3})

**Other Points:**

- 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 (V
^{3}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 contribute@geeksforgeeks.org. 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.

## Recommended Posts:

- Check if the array can be sorted using swaps between given indices only
- Find the weight of the minimum spanning tree
- Longest path in a directed Acyclic graph | Dynamic Programming
- Find the shortest distance between any pair of two different good nodes
- Number of ways to select a node from each connected component
- Number of special nodes in an n-ary tree
- Minimum distance to the corner of a grid from source
- Ways to Remove Edges from a Complete Graph to make Odd Edges
- Print the lexicographically smallest DFS of the graph starting from 1
- Find the maximum value permutation of a graph
- Number of Hamiltonian cycle
- Minimum edges to be added in a directed graph so that any node can be reachable from a given node
- Print the lexicographically smallest BFS of the graph starting from 1
- Count the number of nodes at a given level in a tree using DFS