Assertion: ford algorithm | /r/CapableOf | find the shortest path
Facets:
value: between a given node
type: TRANSITIVE-OBJECT
Source sentences:
text: Similar to Dijkstra’s algorithm, the Bellman-Ford algorithm works to find the shortest path between a given node and all other nodes in the graph.