Dijkstra's shortest path animated: settle the closest node, relax its edges, watch distances improve — with a live distance table and pseudocode.
Tip: use samples, upload, copy, download, and send-to actions inside the workspace where available.
Dijkstra's Algorithm Visualizer is a free, browser-based tool that helps you turn raw numbers into clear charts. Dijkstra's shortest path animated: settle the closest node, relax its edges, watch distances improve — with a live distance table and pseudocode. It's built for speed and privacy: Everything runs locally in your browser — your data is never uploaded to a server. No sign-up, no installs, and no daily limits.
Visualize the dataset after it has been cleaned enough for reliable labels and numeric values.
Review the preview, copy or download the result, and keep everything local in your browser.
Bellman-Ford Visualizer: Bellman-Ford animated: relax every edge V−1 rounds, watch distances converge, and see why a further improvement would prove a negative cycle.
Open toolPathfinding Visualizer: Draw walls and weights on a grid, then watch BFS, DFS, Dijkstra, A*, and Greedy Best-First explore and find the shortest path — with step narration and visit-count comparisons.
Open toolFloyd-Warshall Visualizer: Floyd-Warshall animated: the all-pairs distance matrix updates as each node is allowed as a stopover — every improving triple shown in the table.
Open toolA:0 B:∞ C:∞ D:∞ E:∞ F:∞ G:∞
1Dijkstra from A: always settle the closest unsettled node — with non-negative weights its distance can never improve again. Distance row shown under the graph.
dist[start] = 0, rest ∞while unsettled nodes remain:u = closest unsettled; settle itfor each edge (u, v, w):if dist[u]+w < dist[v]: updatedist[] holds shortest distances
Settle the closest unsettled node, relax its edges, repeat. Correct only with non-negative weights (else Bellman-Ford).
