Bellman–Ford Algorithm
Single-source shortest paths with negative edges and reachable negative-cycle detection.
Single-source shortest paths with negative edges and reachable negative-cycle detection.
Single-source shortest paths with nonnegative edge weights.
Dynamic programming for all-pairs shortest paths and negative-cycle detection.
The recurrence view of shortest paths and a bridge to graph-specific algorithms.