Pathfinding Visualizer
Add Start Node
Add End Node
Select Algorithm:
Dijkstra
Breadth-First Search (BFS)
Depth-First Search (DFS)
A* (A-star)
Bidirectional Dijkstra
Speed:
Slow
Medium
Fast
Select Maze:
Random Maze
Recursive Division
Generate Maze
Visualize
Clear Grid
Dark Mode:
💡 Drag on the grid to create or remove walls.
❌ No path found between start and end nodes!
Got it!