Select an algorithm and click visualize to see the explanation of each step.
The A* Search successfully found a path from the start node to the end node. It explored 380 nodes before finding a path of length 103.
The algorithm was moderately efficient with an efficiency rating of 27%.
| Algorithm | Type | Guarantees Shortest Path | Time Complexity | Space Complexity | Best Use Case |
|---|---|---|---|---|---|
| Dijkstra's Algorithm | Weighted | Yes | O((V + E)log V) | O(V) | When you need the guaranteed shortest path in a weighted graph |
| A* Search | Weighted | Yes | O(E) | O(V) | When you have a good heuristic to guide the search |
| Greedy Best-First | Weighted | No | O(E) | O(V) | When speed is more important than finding the optimal path |
| Breadth-First Search | Unweighted | Yes | O(V + E) | O(V) | For unweighted graphs when you need the shortest path |
| Depth-First Search | Unweighted | No | O(V + E) | O(V) | When you want to explore as far as possible along each branch |