Interactive visual
01 · core
A* Pathfinding
expand the node that looks cheapest so far plus estimated cost to go
A* searches a graph by always expanding the node with the lowest cost so far plus estimated cost to go. With an admissible heuristic, the path is optimal.