A* Pathfinding Algorithm

Best-first search using f(n)=g(n)+h(n) heuristic.

graphspathfindingheuristicUpdated 2025-09-01

Heuristic

Admissible: never overestimates

Data Structure

Priority queue by f(n)