Assertion: algorithm | /r/ObjectUse | used on transformed graph
Facets:
Source sentences:
text: It works by using the Bellman–Ford algorithm to compute a transformation of the input graph that removes all negative weights, allowing Dijkstra's algorithm to be used on the transformed graph.