You need to enable JavaScript to run this app.
Dijkstra's Algorithm
Depth-first Search
Breath-first Search
A* Search
Greedy Best-first Search
Click on the grid to add a wall.
Walls are impenetrable, meaning that a path cannot cross through them