AStar: Guided Dijkstra Algorithm

The Introduction Imagine a GPS that finds the shortest route by sequential checking every single intersection, road by road, in all directions. That&rsquo;s essentially how Dijkstra&rsquo;s algorithm works. It’s guaranteed to find the absolute shortest path, but it does so without any sense of direction. For small maps, this is no big deal. But for large, complex environments, this…