Wall
Start
End
Solve
A* Search
Dijkstra
BFS
DFS
Greedy Best-First
Maze
Clear
Click to place walls. Set start/end points, then solve.