mirror of
https://github.com/kamranahmedse/developer-roadmap.git
synced 2026-09-21 12:44:00 +08:00
github-actions[bot]andnilbuild
58c0669052
Co-authored-by: nilbuild <4921183+nilbuild@users.noreply.github.com>
636 B
636 B
A* Algorithm
A* is a graph traversal algorithm that is used to find the shortest path between two nodes in a graph. It is a modified version of Dijkstra's algorithm that uses heuristics to find the shortest path. It is used in pathfinding and graph traversal.
Visit the following resources to learn more: