Algo Visualizer

Matrix Path Finder

🧀
🐭
Source
Target
Wall
Visited
Path
Source Code
1// Select BFS or DFS to see the code
1x

Grid Pathfinding Algorithms

Step 1 of 4

Visualize how various algorithms search for a path from a start node (green) to a target node (red) on a 2D grid filled with obstacles.

Breadth-First Search (BFS)

Explores the grid level-by-level, radiating outwards from the source. Guarantees the shortest path on an unweighted grid.

S
1
2
3
1
2
3
4
2
3
4
T
3
4
T
5
Numbers show wave-front expansion order