Graph Lab
Algorithm
Breadth-First Search
Depth-First Search
Dijkstra's Shortest Path
A* Pathfinding
Kruskal's MST
Prim's MST
Topological Sort
Graph
Random (15 nodes)
Grid (4×4)
Binary Tree
Complete (8 nodes)
DAG (for topsort)
Sparse (20 nodes)
Run
Step
Reset
New Graph
Speed
Click canvas to add nodes · Drag to move · Right-click to set start/end
Controls
Left-click: add node
Drag node: move it
Right-click node: set start
Shift+right-click: set end
Delete/Backspace: remove hovered