What are the limitations of Dijkstra's algorithm?

What are the limitations of Dijkstra's algorithm?

Dijkstra's algorithm is great for finding the shortest path, but it has some limitations. For instance, it doesn't work with negative weight edges, and it can be inefficient for very large graphs.

Why can't Dijkstra's algorithm handle negative weight edges?

Dijkstra's algorithm assumes that once a node's shortest path is found, it won't change. Negative weights can lead to shorter paths being discovered after a node is processed.

Are there any alternatives to Dijkstra's algorithm?

Yes, alternatives include the Bellman-Ford algorithm, which can handle negative weights, and A* search, which is often more efficient for pathfinding in games.

In what scenarios would you recommend using A* over Dijkstra's?

A* is recommended when you have a heuristic that can guide the search, making it faster for specific applications like game development or navigation.