Interactive 2D science lab
Dijkstra Pathfinding: Navigate a Procedural Maze
Generate a maze and watch Dijkstra’s algorithm explore the grid to find a shortest route.
Explore the science
Dijkstra’s algorithm repeatedly visits the unprocessed cell with the smallest known path cost, then relaxes its neighbours. With uniform movement costs, it finds a shortest path. Obstacles, search speed and diagonal movement alter the exploration.