Statements (29)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
graph shortest path algorithm |
| gptkbp:advantageOverDijkstra |
handles negative weights
|
| gptkbp:alternativeTo |
gptkb:Dijkstra's_algorithm
|
| gptkbp:category |
dynamic programming
graph theory |
| gptkbp:complexity |
O(VE)
|
| gptkbp:detectsNegativeCycles |
true
|
| gptkbp:disadvantageOverDijkstra |
slower
|
| gptkbp:firstPublished |
1958
|
| gptkbp:handlesNegativeWeights |
true
|
| https://www.w3.org/2000/01/rdf-schema#label |
Bellman-Ford algorithm
|
| gptkbp:input |
graph
source vertex |
| gptkbp:namedAfter |
gptkb:Richard_Bellman
gptkb:Lester_Ford_Jr. |
| gptkbp:output |
shortest path distances
predecessor information |
| gptkbp:solvedBy |
single-source shortest path
|
| gptkbp:spaceComplexity |
O(V)
|
| gptkbp:usedIn |
computer science education
network routing distance-vector routing protocols |
| gptkbp:worksOnGraphType |
graph
weighted graph |
| gptkbp:bfsParent |
gptkb:Dijkstra's_algorithm
gptkb:Graph_theory |
| gptkbp:bfsLayer |
5
|