Watch algorithms explore — draw walls, place start/end, find the path
Visited: 0 |
Path length: 0 |
Time: 0ms
Start
End
Wall
Weight (5×)
Visited
Frontier
Path
Click/drag to draw walls. A* uses heuristic + cost. Dijkstra uses only cost. BFS ignores weights. DFS goes deep first.
Weights cost 5× more to traverse. Maze uses recursive backtracker.
Source · Built by Henry