Bellman Ford Algorithm

Choose your learning mode:

Vertices (3-7)

Source Vertex

Graph

Build Graph

1. Click a node to select it (Yellow).

2. Click another node to form an edge.

3. Enter weight and click Add.

4. Click Apply to finish.

Add Edge

Speed

Simulation

Analysis

0 Relaxations

O(0) Complexity (V X E)

Tap individual nodes to see the shortest paths from the source node

                     Negative Cycle Detection:
                     for (const { u, v, w } of edges)
  if (dist[u] + w < dist[v]) → Negative cycle!
                     After V-1 iterations, if any edge can still be relaxed, the graph contains a negative cycle.
                  
Shortest Paths from Source