Interactive LabClient-side Simulation

Dijkstra Shortest Path

Step-by-step shortest path exploration with relaxation table and priority queue.

Start:
Target:
4215810263Ad=Bd=Cd=Dd=Ed=Fd=
Relaxation Table (Shortest Distance Estimates)
A
prev: -
B
prev: -
C
prev: -
D
prev: -
E
prev: -
F
prev: -

Related Tools

Graph Traversal (BFS & DFS)

Interactive graph sandbox visualizing Queue-based BFS and Call Stack DFS.

Open Tool
Union-Find (Disjoint Set)

Disjoint set union simulator comparing rank union and path compression.

Open Tool