Pathfinding Comparator
A*, Dijkstra and friends, visible step by step.
What is this?
A visual pathfinding lab for comparing how algorithms search. The same grid, walls and endpoints reveal different exploration strategies.
How it works
Algorithms expand nodes according to their rules: cost so far, heuristic distance or queue order. Watching the frontier makes the tradeoff between optimality and speed tangible.