GRAPH EDITOR
Click empty space to drop routers, double-click one to draw a weighted link, drag to rearrange. Marquee-select or Ctrl/⌘-click for multi-select, then move whole clusters together.
You'll learn: Graph ADT · adjacency lists · edge weights
Data Structures & Algorithms
Build a network.
Watch algorithms find the shortest path.
An interactive teaching simulator for graph algorithms. Place routers, connect them with weighted links, then run Dijkstra, BFS, DFS, or Bellman-Ford and see the priority queue, visited set, and packet come alive.
What you can do
Every feature maps to a concrete DSA concept — the simulator is the lab, the graph is the whiteboard.
FOUR CLASSIC ALGORITHMS
Run Dijkstra, BFS, DFS, or Bellman-Ford on the same graph. Each step yields a typed event — enqueue, visit, relax, settle — so you literally see the priority queue and visited set evolve.
You'll learn: Greedy · DP · min-heap · queue · stack
LIVE VISUALIZATION
Nodes glow through idle → frontier → visiting → settled as the algorithm progresses. A packet animates along the final shortest path with speed you can dial 0.25× to 4× mid-run.
You'll learn: State machines · algorithm animation
ROUTING TABLES
The Inspector auto-generates a next-hop table from the source: destination, next hop, total cost, hop count. Exactly what a real router computes after running SPF.
You'll learn: Predecessor arrays · path reconstruction
LINK FAILURE & REROUTING
Right-click any link to toggle failure. The failed edge dashes red; re-run the algorithm and watch the packet take a different route — the same reactive behaviour OSPF or IS-IS exhibits after a link event.
You'll learn: Dynamic graphs · reactive routing
IMPORT, EXPORT, UNWEIGHTED MODE
Save any topology as JSON, reload it later, or share a demo. Flip the unweighted switch to treat every edge as cost 1 — the natural setting to compare BFS against Dijkstra.
You'll learn: Serialization · empirical complexity