Comparison between Shortest Path Algorithms:
Last Updated :
13 Oct, 2023
Finding the shortest way is becoming more important in a world where time and distance matter. There are multiple shorted path algorithms exists. Therefore, in this article, we will compare the shortest path algorithms on the basis of their complexity and their performance, which will help us to use the correct algorithm according to our requirements.
The shortest path algorithms are the ones that focuses on calculating the minimum travelling cost from source node to destination node of a graph in optimal time and space complexities.
In this article we’re focusing on the differences between shortest path algorithms that are:
- Depth-First Search (DFS)
- Breadth-First Search (BFS)
- Multi-Source BFS
- Dijkstra’s algorithm
- Bellman-Ford algorithm
- Floyd-Warshall algorithm
- A* search algorithm
- Johnson’s algorithm
Complexity Differences Between the Shortest Path Algorithms:
Here V and E, denote the number of vertices and the number of Edges in the graph respectively.
|
O(V + E)
|
O(V)
|
|
O(V+E)
|
O(V)
|
|
O(V+E)
|
O(V)
|
|
O(E*log(V))
|
O(V)
|
|
O(V*E)
|
O(V)
|
|
O(V^3)
|
O(V^2)
|
|
O(E*log(V))
|
O(V)
|
|
O(V^2 * log V + V*E)
|
O(V^2)
|
Differences Between the Shortest Path Algorithms based on their Working:
- DFS is a graph traversal technique that starts at the root node and explores as far as possible along each branch before backtracking.
- Unlike other algorithms like Dijkstra’s or A* search, DFS does not guarantee finding the shortest path. It might find a path, but it could be longer than other potential routes.
- While it may not be ideal for finding the shortest path, DFS has applications in other areas such as topological sorting, cycle detection, and solving puzzles like mazes.
- DFS can get stuck in infinite loops if not carefully implemented or if the graph is cyclic. To avoid this, cycle detection mechanisms are often needed.
- DFS is commonly used when the goal is not to find the shortest path, but to explore or traverse a graph or tree in a systematic way.
- Has very limited use as compared to other shortest path algorithms.
- Uses Queue data Structure.
- In unweighted graphs, BFS and Multi-Source BFS can find the shortest path from a source node to all other reachable nodes.
- When used on an unweighted graph, Number of edges between source node and destination nodes act the distance between them.
- It works on Non-Negative Weighted graphs.
- It follows Greedy Approach
- It is a single source shortest path algorithm
- Uses BFS to solve.
- Lesser overheads than Bellman-Ford
- It works for all types of graphs given that negative cycles does not exist in that graph.
- It follows DP approach.
- It is a single source shortest path algorithm.
- Bellman Ford’s Algorithm have more overheads than Dijkstra’s Algorithm.
- It works for all types of graphs given that negative cycles does not exist in that graph.
- It follows DP approach.
- It is an all pair shortest path algorithm
- This algorithm takes most time and space among all other algorithms.
- Unlike other algorithms, this one is considered to have “brains”.
- Many web-based maps use this algorithm to find the shortest path very efficiently (approximation).
- A* is well-suited for finding the shortest path from a starting node to a goal node in a weighted graph or grid. It is especially efficient when you have a good heuristic that estimates the cost from the current node to the goal (admissible and consistent heuristic).
- A* is optimal, meaning it guarantees finding the shortest path if the heuristic is admissible (never overestimates the true cost).
- It is an all pair shortest path algorithm which performs better than Floyd-Warshall algorithm.
- It works for all types of graphs given that negative cycles does not exist in that graph.
- It is Efficient for Sparse graphs.
Related Articles:
Share your thoughts in the comments
Please Login to comment...