Assertion: graph's path | /r/Desires | the bellman–ford algorithm
Facets:
value: for arbitrary graphs
type: PURPOSE
Source sentences:
text: In contrast, for arbitrary graphs the shortest path may require slower algorithms such as Dijkstra's algorithm or the Bellman–Ford algorithm, and longest paths in arbitrary graphs are NP-hard to find.