P

Pathfinding Visualizer

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

Algorithms v1.0.0 24 uses
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. 1 Click and drag on the grid to draw walls (obstacles)
  2. 2 Drag the green start or red end markers to reposition them
  3. 3 Choose an algorithm from the dropdown
  4. 4 Click Find Path to watch the algorithm explore
  5. 5 Click Clear Walls to remove obstacles, or Reset to start fresh
  6. 6 Compare how different algorithms explore the grid differently
X Facebook LinkedIn Reddit WhatsApp Telegram Pinterest Email

More Simulators in Algorithms

F

Finite State Machine

Algorithms

Build and run finite state machines — define states, transitions, and test input strings.
B

Binary Search Tree

Algorithms

Insert, search, and delete nodes in a binary search tree with real-time visualization.
H

Hash Table

Algorithms

Visualize hash table insertions, lookups, and collision resolution strategies.

Translate

ESC