Draw walls and weights on a grid, then watch BFS, DFS, Dijkstra, A*, and Greedy Best-First explore and find the shortest path — with step narration and visit-count comparisons.
Tip: use samples, upload, copy, download, and send-to actions inside the workspace where available.
Pathfinding Visualizer lets you draw walls and weighted cells on a grid, then watch BFS, DFS, Dijkstra, A*, and Greedy Best-First explore it — the frontier floods outward, visited cells tint, and the shortest path draws itself when found. Comparing visit counts between runs shows exactly why A*'s heuristic matters.
The same relaxation logic on nodes and weighted edges, step by step.
Open toolDrag the green start or the red target to move them. Click or drag on the grid to draw with the selected tool — the Weight brush paints sand cells that cost 5 to enter. Starting a stroke on an existing wall or weight erases it.
Finish a run, then run a different algorithm on the same grid to see how many cells each one had to visit.
