Bellman–Ford–Moore algorithm

GPTKB entity

Predicate	Object
gptkbp:instanceOf	gptkb:algorithm shortest path algorithm
gptkbp:advantage	Dijkstra's algorithm (handles negative weights)
gptkbp:alsoKnownAs	gptkb:Bellman–Ford_algorithm gptkb:Ford–Moore_algorithm
gptkbp:cannot_handle	graphs with negative weight cycles
gptkbp:category	dynamic programming graph algorithms
gptkbp:complexity	O(VE)
gptkbp:contrastsWith	gptkb:Dijkstra's_algorithm
gptkbp:detects	negative weight cycles
gptkbp:disadvantageComparedTo	Dijkstra's algorithm (slower in practice)
gptkbp:field	computer science graph theory
gptkbp:handles	graphs with negative edge weights
https://www.w3.org/2000/01/rdf-schema#label	Bellman–Ford–Moore algorithm
gptkbp:input	source vertex weighted directed graph
gptkbp:introducedIn	1956
gptkbp:namedAfter	gptkb:Edward_F._Moore gptkb:Richard_Bellman gptkb:Lester_Ford_Jr.
gptkbp:output	shortest path distances from source predecessor information for path reconstruction
gptkbp:publishedBy	gptkb:Edward_F._Moore gptkb:Richard_Bellman gptkb:Lester_Ford_Jr.
gptkbp:solvedBy	single-source shortest path problem
gptkbp:usedIn	gptkb:RIP_(Routing_Information_Protocol) gptkb:distance-vector_routing network routing protocols
gptkbp:bfsParent	gptkb:Moore's_algorithm
gptkbp:bfsLayer	6