Graph Algorithms Visualizer

Build, edit, save, and step through shortest path algorithms with clear visual feedback.

Select Algorithm

Graph Controls

Algorithm Controls

Workspace

Mode: Select and drag nodes
Nodes: 0 | Edges: 0
Click a mode, then use the canvas. Drag nodes anytime.

Current Step

Select an algorithm and press Run or Step to start.

Distance Table

Node Distance Previous
Click nodes to select. Drag nodes to rearrange. Click an edge line or label to edit/delete it. Dijkstra requires non-negative edge weights.

How to Use

1. Build or Load

Add nodes, connect directed weighted edges, load examples, generate a random graph, or restore a local save.

2. Edit Safely

Select nodes or edges to rename, update weights, or delete. Duplicate edges are updated instead of stacked.

3. Choose Algorithm

Dijkstra is fast for non-negative weights. Bellman-Ford handles negative weights and detects negative cycles.

4. Run or Step

Use Run for animation or Step to inspect each relaxation and distance table update.