Papalocal
Loading…
Papalocal · Things
Work

Bellman–Ford algorithm

Bellman–Ford algorithm is an algorithm for finding single-source shortest paths in graphs, allowing some edge weights to be negative.

All 5 facts, and where they come from

Facts

5 facts · 0 confirmed by two sources · 0 cited · 5 from one source

What it is
pathfinding algorithm One source
graph algorithm One source
mathematical concept One source
Named after
L. R. Ford, Jr. One source

Where this comes from

Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.

What Wikidata says · copied November 17, 2026 · revision 2464157367
Described as
algorithm for finding single-source shortest paths in graphs, allowing some edge weights to be negative
Other names
Bellman–Ford–Moore algorithm, Bellman-Ford equation, distance-vector routing algorithm
What it is
pathfinding algorithm; graph algorithm; mathematical concept
Named after
Richard E. Bellman; L. R. Ford, Jr.
Wikipedias with a page
30

Wikidata item Q816022 (wikidata.org/wiki/Q816022), public domain (CC0). Copied 2026-11-17.

What Wikipedia says · copied November 17, 2026 · revision 1384606042

The Bellman–Ford algorithm is an algorithm that computes shortest paths from a single source vertex to all of the other vertices in a weighted digraph.
It is slower than Dijkstra's algorithm for the same problem, but more versatile, as it is capable of handling graphs with negative edge weights. The algorithm was first proposed by Alfonso Shimbel (1955), but is instead named after Richard Bellman and Lester Ford Jr., who published it in 1958 and 1956, respectively. Edward F. Moore also published a variation of the algorithm in 1959, and for this reason it is also sometimes called the Bellman–Ford–Moore algorithm.
Negative edge weights are found in various applications of graphs. This is why this algorithm is useful.
If a graph contains a "negative cycle" (i.e. a cycle whose edges sum to a negative value) that is reachable from the source, then there is no cheapest path: any path that has a point on the negative cycle can be made cheaper by one more walk around the negative cycle. In such a case, the Bellman–Ford algorithm can detect and report the negative cycle.

From the Wikipedia article “Bellman–Ford algorithm” (en.wikipedia.org/wiki/Bellman–Ford_algorithm), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-17; not changed.

Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.

Picture: Wikimedia Commons: Bellman–Ford algorithm example.gif · See Commons file page

People connected 1

Known for it