mirror of
https://github.com/kamranahmedse/developer-roadmap.git
synced 2026-10-25 17:42:27 +08:00
github-actions[bot]andnilbuild
b79e7bbdb6
Co-authored-by: nilbuild <4921183+nilbuild@users.noreply.github.com>
299 B
299 B
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.