Bellman-Ford Monster
Computes single-source shortest paths. Unlike Dijkstra's algorithm, it supports negative edge weights and can detect negative weight cycles.
0
Total Nodes
0
Total Edges
Ready
Iteration Pass
None
Negative Cycles
BELLMAN-FORD GRAPH
💡 Editor Guide: Click empty space to add a node. Click and drag between nodes to connect them with a weighted directed edge.
Execution Log
Click Load Negative Cycle or design a graph, then run Bellman-Ford.
📊 Distances From Source (Node 1)
| Node | Distance |
|---|---|
| No nodes defined. | |
🛠️ Presets
⚡ Time Complexity
Time complexity is O(V * E) where V is nodes and E is edges. Relaxations run exactly V - 1 times, followed by cycle check.