A* Algorithm Example

A* finds the shortest path to a single goal node from a given start. A* will do less work than Dijkstra because it focuses its search on the goal using the heuristic.