Bellman-Ford Algorithm

Algorithm for shortest paths in weighted graphs.

Bellman-Ford

The Bellman-Ford algorithm is an algorithm used to find the shortest paths from a single source node to all other nodes in a weighted graph, even when negative edge weights are present. It works by iteratively relaxing edges until no further improvement can be made, and can also detect if a negative cycle exists within the graph.

The Bellman-Ford algorithm is named after Richard Bellman and Forrest George Bell, who independently developed similar algorithms.

shortest path algorithm

graph algorithms

algorithm graph theory