|
gptkbp:instanceOf
|
gptkb:algorithm
graph
shortest path algorithm
|
|
gptkbp:advantage
|
Dijkstra's algorithm for negative weights
|
|
gptkbp:canBeParallelized
|
yes
|
|
gptkbp:category
|
computer science
dynamic programming
graph theory
|
|
gptkbp:contrastsWith
|
gptkb:Dijkstra's_algorithm
|
|
gptkbp:detects
|
negative weight cycles
|
|
gptkbp:firstPublished
|
1958
|
|
gptkbp:handles
|
graphs with negative edge weights
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
Bellman–Ford algorithm
|
|
gptkbp:input
|
source vertex
weighted directed graph
|
|
gptkbp:limitation
|
slower than Dijkstra's algorithm for non-negative weights
does not work with negative cycles for shortest path
|
|
gptkbp:namedAfter
|
gptkb:Richard_Bellman
gptkb:Lester_Ford_Jr.
|
|
gptkbp:output
|
shortest path distances from source
predecessor information for paths
|
|
gptkbp:publishedIn
|
RAND Corporation research
|
|
gptkbp:solvedBy
|
single-source shortest path problem
|
|
gptkbp:spaceComplexity
|
O(V)
|
|
gptkbp:usedIn
|
gptkb:RIP_(Routing_Information_Protocol)
gptkb:distance-vector_routing
network routing protocols
|
|
gptkbp:worstCaseTimeComplexity
|
O(VE)
|
|
gptkbp:bfsParent
|
gptkb:Richard_Bellman
gptkb:Floyd–Warshall_algorithm
gptkb:Moore's_algorithm
|
|
gptkbp:bfsLayer
|
6
|