# A* Algorithm

A\* is a pathfinding and graph traversal algorithm that finds the shortest path between two nodes. It combines the guarantees of Dijkstra's algorithm with a heuristic that estimates the remaining distance, guiding the search toward the goal and exploring far fewer nodes in practice.