⬅ Home
About
Controls
Algorithm
Dijkstra
Bellman-Ford
A*
BFS
Graph Type
Undirected
Directed
Nodes (≤ 50)
Generate Graph
Load Preset
▶ Run
⏸ Pause
Allow Negative Weights
Speed
Instructions
Click a node to set
Start
(green ring).
Shift
+click a node to set
Target
(A* only).
Drag a node to move it.
Generate Graph
makes a random graph (it won't be very neat);
Load Preset
(default) loads a neat layout.
Run
steps the algorithm;
Speed
controls pacing;
Pause
stops.
Completion: green edges =
shortest-path tree
from Start. With A*, you’ll also see the best path to Target.
Priority Queue
shows the frontier (Dijkstra by
dist
, A* by
f=g+h
).
Graph Visualization
Priority Queue
Live step
—
About: Dijkstra
Pseudocode
Complexity
Case
Time
Space
Stable
C++
Java
Python