50
Instructions:
- • Click and drag to draw walls
- • = Start node
- • = End node
- • = Wall
- • = Visited
- • = Path
Bellman-Ford Algorithm
Handles negative edge weights and detects negative cycles. More robust than Dijkstra but slower. Used in routing protocols (BGP).
Time Complexity
Best:
O(V * E)Average:
O(V * E)Worst:
O(V * E)Space Complexity
O(V)Color Legend
Default
Comparing
Swapping
Sorted
Pivot
Setting Value