Visualize how Dijkstra's algorithm finds the shortest path between two points
About Dijkstra's Algorithm
Dijkstra's algorithm is a method for finding the shortest path between nodes in a graph. It works by visiting nodes in order of their distance from the starting point, ensuring that when we reach the target node, we've found the shortest path.
Path Length
-
Nodes Visited
-
Time Taken
-
How to Use
Select Start Point mode and click on a cell to set the starting position
Select End Point mode and click on a cell to set the target position
Select Wall mode and click/drag to create obstacles
Select Erase mode to remove walls
Click Visualize Algorithm to see the algorithm in action
Click Reset Grid to clear everything and start over