Graph & Pathfinding
Edge Relaxation Engine
Bellman-Ford Algorithm Visualizer
Unlike Dijkstra's, Bellman-Ford handles negative-weight edges by relaxing every edge |V|−1 times. Watch distance tables update after each relaxation pass and see negative-cycle detection in action.
Edge Relaxation
Iterates |V|−1 times over all edges.
Negative Cycles
Detects unreachable optimal states.
O(VE) Complexity
Slower than Dijkstra, more general.
Bellman-Ford Algorithm Visualizer
A
0
B
∞
C
∞
D
∞
E
∞
Edges:
A → B (w = 4)
A → C (w = 2)
B → C (w = -1)
B → D (w = 2)
C → D (w = 3)
D → E (w = 2)
Current Pass: 0
Click Start to visualize Bellman-Ford.