Assertion: ford algorithm | /r/ObjectUse | used on graph
Facets:
value: unlike dijkstra's algorithm
type: OTHER
value: with negative edge weights
type: OTHER
Source sentences:
text: Unlike Dijkstra's algorithm, the Bellman–Ford algorithm can be used on graphs with negative edge weights, as long as the graph contains no negative cycle reachable from the source vertex s.