Bellman-Ford Solver
Shortest PathMediumCompute single-source shortest paths and detect negative cycles on weighted graphs.
Alt+Shift+F
Configuration Panel
Complexity Mappings
Time ComplexityO(V * E)
Space ComplexityO(V) distance state space
Interactive SVG Graph Canvas
🖱️ Middle-drag to Pan🎡 Scroll wheel to Zoom⌨️ Shift-drag snap to 20px grid
Inspector Panel
Select a vertex or edge to inspect details.
Graph Wizard
Conceptual Overview
Bellman-Ford's Algorithm computes single-source shortest paths on weighted graphs, supporting negative weights and detecting negative cycles.
Algorithm Mechanism
Relaxes all E edges V - 1 times. If any edge can be relaxed on the V-th sweep, a negative weight cycle reachable from the source exists.
Source: CP-Algorithms reference guide