Bellman-Ford Algorithm

## How Bellman-Ford Algorithm Works

Bellman-Ford finds shortest paths from a source node to all other nodes in a weighted graph. Unlike Dijkstra's, it can handle negative edge weights and detect negative weight cycles.

### Algorithm Steps:
1. Set distance to source = 0, all others = infinity
2. Repeat V-1 times:
- For each edge (u, v) with weight w:
- If distance[u] + w < distance[v], update distance[v]
3. Run one more iteration to detect negative cycles

### Key Characteristics:
- **Handles negative weights**: Works with negative edge weights
- **Cycle detection**: Can detect negative weight cycles
- **Slower than Dijkstra**: O(V × E) vs O((V + E) log V)
- **Dynamic programming**: Builds solution incrementally