Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:alsoKnownAs |
gptkb:Bellman–Ford_algorithm
|
| gptkbp:category |
shortest path algorithm
|
| gptkbp:complexity |
O(VE)
|
| gptkbp:contrastsWith |
gptkb:Dijkstra's_algorithm
|
| gptkbp:detects |
negative weight cycles
|
| gptkbp:distinctFrom |
Dijkstra's algorithm cannot handle negative weights
|
| gptkbp:field |
computer science
graph theory |
| gptkbp:handles |
graphs with negative edge weights
|
| https://www.w3.org/2000/01/rdf-schema#label |
Ford–Moore algorithm
|
| gptkbp:input |
weighted directed graph
|
| gptkbp:namedAfter |
gptkb:Richard_Bellman
gptkb:Lester_R._Ford,_Jr. Delbert F. Moore |
| gptkbp:output |
shortest path distances from source
predecessor information for paths |
| gptkbp:publishedIn |
1956
|
| gptkbp:solvedBy |
single-source shortest path problem
|
| gptkbp:usedIn |
operations research
network routing |
| gptkbp:bfsParent |
gptkb:Bellman–Ford–Moore_algorithm
|
| gptkbp:bfsLayer |
7
|