Dijkstra's Algorithm

Finds the shortest path between nodes in a graph. Iteratively calculates the distance between current node and neighboring nodes to find the optimal path.

Pathfinding Visualization

Click the New grid button to clear the current grid and create a new grid.

Click the Generate random maze button to generate a maze using randomized depth-first search with recursive backtracking. This guarantees a path from start to end node.

Click the Visualize shortest path to see a real-time visualization of the current pathfinding algorithm in action.

Start Node

End Node

Obstacle Node

Wall Node

Unvisited Node

Path Node

Visited Node