Graph Algorithms Visualizer

Interactive visualization tool for Dijkstra's and Bellman-Ford shortest path algorithms

Select Algorithm

Graph Controls

Algorithm Controls

Current Step

Select an algorithm and press Run or Step to start.

Distance Table

Node Distance Previous

How to Use

1. Create or Select a Graph

Add nodes by clicking "Add Node" and then clicking on the canvas. Connect nodes by selecting "Add Edge", clicking on a source node, then a target node, and entering the weight.

Alternatively, load one of the example graphs.

2. Choose an Algorithm

Select either Dijkstra's or Bellman-Ford algorithm. Remember that Dijkstra's doesn't work with negative edges, while Bellman-Ford can handle them.

3. Set Start Node

Select your starting node from the dropdown.

4. Run or Step Through

Press "Run" to see the full algorithm or "Step" to advance one step at a time.