Pathfinding Visualization

interactive A* and Dijkstra on a grid

Algorithm Notes

Summary: A* search using f(n)=g(n)+h(n) with admissible heuristic.
Time: Depends on heuristic; up to O(b^d) worst-case
Space: O(b^d) for open/closed sets
Notes: Admissible and consistent heuristics ensure optimality; common h: Manhattan/Euclidean.

Big-O Guide

Ready