A* Search Algorithm

A Search is a shortest-path algorithm that uses a heuristic to guide its exploration toward a specific goal. Where Dijkstra's algorithm expands outward in all directions from the source, A prioritizes nodes that appear closer to the destination, which lets it find the shortest path while exploring far fewer nodes.

A* is widely used in GPS navigation, game pathfinding, and robotics motion planning, anywhere a single shortest path needs to be computed quickly between a known start and a known goal.