Opening page…
An interactive grid for graph search. Draw walls, drop a start and end point, and run BFS, DFS, Dijkstra, or A* to see which cells each algorithm explores and the shortest path it returns.
Click and drag on the grid to draw or erase walls.
Runs entirely in your browser — your data never leaves this page.