Bellman–Ford algorithm

algorithm for finding single-source shortest paths in graphs, allowing some edge weights to be negative
rdfs:label
"Bellman–Ford algorithm"@en
skos:altLabel
"Bellman-Ford equation"@en
"Bellman–Ford–Moore algorithm"@en
"distance-vector routing algorithm"@en
schema:description
"algorithm for finding single-source shortest paths in graphs, allowing some edge weights to be negative"@en
schema:dateModified "2026-02-17T11:37:05+00:00"^^xsd:dateTime
schema:version 2464157367
wikibase:identifiers 6
wikibase:sitelinks 30
wikibase:statements 25
p:P138 wd:statement/q816022-3ce8e24a-4002-388f-61f3-b24222add762
wd:statement/q816022-a1e24618-4989-5725-922a-64d2291f209c
p:P1535 wd:statement/Q816022-1869af64-46a3-be78-ff31-feb2ccb4dcde
p:P18 wd:statement/Q816022-19d21e55-4b70-4b99-c970-2adf6fcfbedf
p:P2159 wd:statement/Q816022-9bf0aabb-45e8-480c-65e7-f0731fba3882
wd:statement/Q816022-ac18511f-4d26-a8fc-3a0e-57680415a324
p:P2283 wd:statement/Q816022-6008E27E-B30C-4FA7-B97B-1CEF31802F78
p:P31 wd:statement/Q816022-5C6EF72A-925C-4E20-9B39-9CD0B499CC53
wd:statement/Q816022-6a7cbd06-4c46-b4e7-db2e-60ff3ca757ad
wd:statement/Q816022-C83C7C8C-C04F-47FE-9CB0-9085B8D8E388
p:P373 wd:statement/Q816022-7aa50a6c-2d67-4377-9dc8-4e29a223521f
p:P3752 wd:statement/Q816022-c87cbf3f-402f-2496-3089-a20cf33e87b5
p:P3753 wd:statement/Q816022-D4BAB052-C94F-47B2-93AE-B4ECD1C27DD2
p:P3755 wd:statement/Q816022-39C90448-06CA-4BEA-B88F-686B26E8C5D3
p:P4969 wd:statement/Q816022-33e4c1fe-4afb-d639-fcde-44522fa61b97
wd:statement/Q816022-ee46910b-4bbf-dfce-346b-8a66b4485287
p:P5106 wd:statement/Q816022-496A4572-68F7-44DD-98CF-D7E5C53AB2C4
wd:statement/Q816022-86FC9D52-84C4-44C4-BFF1-F753005E7519
p:P61 wd:statement/Q816022-181761d1-464b-fd00-d152-d83dc4f4ea20
wd:statement/Q816022-9697d8de-4992-7db3-61e7-9a75688fd268
wd:statement/Q816022-b0a26925-4acf-7184-1ff4-bb38b5600a2c
p:P6366 wd:statement/Q816022-CE210C13-0BFB-463B-ADFC-D20A6806CB18
p:P646 wd:statement/Q816022-70944DCC-EE0F-4E12-BC4B-687D8A755DDB
p:P6564 wd:statement/Q816022-0fcbe532-4ac2-3f1d-65b5-01f471feca92
p:P9100 wd:statement/Q816022-DB551792-3B3E-4751-8991-4F2FC8368121
p:direct-normalized/P6366 <https://makg.org/entity/2780110560>
wdt:P138 L. R. Ford, Jr.
Richard E. Bellman
wdt:P1535 distance-vector routing protocol
wdt:P18 <http://commons.wikimedia.org/wiki/Special:FilePath/Bellman%E2%80%93Ford%20algorithm%20example.gif>
wdt:P2159 single-source shortest path problem
shortest path problem
wdt:P2283 graph data structure
wdt:P31 pathfinding algorithm
mathematical concept
graph algorithm
wdt:P373 "Bellman–Ford algorithm"
wdt:P3752 "<math class="mwe-math-element mwe-math-element-inline" xmlns="http://www.w3.org/1998/Math/MathML"><mrow data-mjx-texclass="ORD"><mstyle displaystyle="true" scriptlevel="0"><mi mathvariant="normal">&#x0398;</mi><mo stretchy="false">(</mo><mo stretchy="false">|</mo><mi>V</mi><mo stretchy="false">|</mo><mo stretchy="false">|</mo><mi>E</mi><mo stretchy="false">|</mo><mo stretchy="false">)</mo></mstyle></mrow></math>"^^http://www.w3.org/1998/Math/MathML
wdt:P3753 "<math class="mwe-math-element mwe-math-element-inline" xmlns="http://www.w3.org/1998/Math/MathML"><mrow data-mjx-texclass="ORD"><mstyle displaystyle="true" scriptlevel="0"><mi mathvariant="normal">&#x0398;</mi><mo stretchy="false">(</mo><mo stretchy="false">|</mo><mi>E</mi><mo stretchy="false">|</mo><mo stretchy="false">)</mo></mstyle></mrow></math>"^^http://www.w3.org/1998/Math/MathML
wdt:P3755 "<math class="mwe-math-element mwe-math-element-inline" xmlns="http://www.w3.org/1998/Math/MathML"><mrow data-mjx-texclass="ORD"><mstyle displaystyle="true" scriptlevel="0"><mi mathvariant="normal">&#x0398;</mi><mo stretchy="false">(</mo><mo stretchy="false">|</mo><mi>V</mi><mo stretchy="false">|</mo><mo stretchy="false">)</mo></mstyle></mrow></math>"^^http://www.w3.org/1998/Math/MathML
wdt:P4969 Routing Information Protocol
Babel
wdt:P5106 "FordBellman"
"bellmanford"
wdt:P61 L. R. Ford, Jr.
Richard E. Bellman
Edward F. Moore
wdt:P6366 "2780110560"
wdt:P646 "/m/01g933"
wdt:P6564 "bellman-ford-algorithm"
wdt:P9100 "bellman-ford-algorithm"
Download as:
TurtleJSON-LDRDF/XML
data from SPARQL profile: Wikidata