developer-roadmap/roadmaps/datastructures-and-algorithms/content/a-algorithm@AabJqPUwFVBVS02YPDPvL.md

A* Algorithm

A* is a shortest path algorithm that uses a heuristic to guide its search toward the goal, making it faster than Dijkstra's in practice. The heuristic estimates the cost from the current node to the destination, helping the algorithm prioritize more promising paths. It is widely used in game pathfinding and robotics.