Pathfinding Visualizer

Visualize A*, Dijkstra, and BFS algorithms finding the shortest path on a grid.

Category: Algorithms · v1.0.0
Visited
0
Path Length
—
Status
Draw walls

About This Simulator

Watch popular pathfinding algorithms explore a grid in real time. Draw walls to create mazes, place start and end points, then run A*, Dijkstra's, or Breadth-First Search to see how each algorithm explores differently. Visited cells are highlighted as the algorithm runs, and the final shortest path is drawn when found.

How It Works

  1. Click and drag on the grid to draw walls (obstacles)
  2. Drag the green start or red end markers to reposition them
  3. Choose an algorithm from the dropdown
  4. Click Find Path to watch the algorithm explore
  5. Click Clear Walls to remove obstacles, or Reset to start fresh
  6. Compare how different algorithms explore the grid differently