Bellman-Ford — Interactive Visualization

Graph

Simple (no negative cycle) Negative edge, converges Negative cycle (detected)

Run

Slow Fast

Algorithm

For each edge u → v (w):
relax = if dist[u]+w < dist[v]
then dist[v]=dist[u]+w

Repeat V−1 rounds.
One extra round that still relaxes ⇒ negative cycle.

Pick a graph and press Step or Run.

Round: 0 / 0

Edge: -

Relaxations: 0

Phase: idle

Negative cycle: no

default source relaxed this step on negative cycle

Relaxation Log