Time: 0 ms
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.