Bellman-Ford Algorithm Visualizer

Interactive shortest path algorithm demonstration

Time Complexity
O(V·E)
Space Complexity
O(V)

Control Panel

Fast 800ms Slow

Execution Statistics

Current Step
0
Relaxations
0
Current Iteration
0 / 0
Status
Ready

Algorithm Pseudocode

Graph Visualization

Current Step Explanation

Click "Start" or "Step" to begin the algorithm visualization.

Distance Table

Node Distance Predecessor

Legend

Source Node
Visited Node
Processing Node
Unvisited Node
Current Edge
Relaxed Edge
Negative Cycle
Normal Edge