Dijkstra's Pathfinding Visualizer

Instructions

  1. Click on the grid to set the start point.
  2. Click again to set the end point.
  3. Adjust speed and click solve to visualize the algorithm.
Time: 0 ms

About Dijkstra's Algorithm

Dijkstra's algorithm is a graph search algorithm that solves the single-source shortest path problem for a graph with non-negative edge weights, producing a shortest path tree. This visualizer demonstrates how the algorithm explores the grid to find the shortest path between the start and end points.