Pathfinding Visualizer
Visualize pathfinding algorithms like Dijkstra's algorithm
Algorithm
Grid Size
Mode
Actions
Start: ✗ | End: ✗ | Path: Not found
Dijkstra AlgorithmGrid Visualization
Start
End
Wall
Visited
Path
Algorithm Information
Dijkstra's Algorithm
Finds the shortest path between two nodes in a weighted graph. It explores all possible paths and guarantees the optimal solution.
Time Complexity:O(V²)
Space Complexity:O(V)
Optimal:Yes
Instructions
1. Select "Start" mode and click a cell to place the start point
2. Select "End" mode and click a cell to place the end point
3. Select "Wall" mode and click cells to create obstacles
4. Click "Run" to visualize the pathfinding algorithm
5. Use "Clear" to reset the grid