Back to Developer Roadmap

A* Algorithm

src/data/roadmaps/computer-science/content/a-algorithm@Yrk2PLUa-_FAPlhCkMl3e.md

4.0738 B
Original Source

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: