Assertion: ford algorithm | /r/CapableOf | compute shortest paths
Facets:
value: from a single source vertex
type: TRANSITIVE-OBJECT
value: in a weighted digraph
type: MANNER
Source sentences:
text: The Bellman–Ford algorithm is an algorithm that computes shortest paths from a single source vertex to all of the other vertices in a weighted digraph.