Assertion: algorithm | /r/ObjectUse | used with same asymptotic running time
Facets:
value: for no negative cycles
type: PURPOSE
value: as the repeated dijkstra approach
type: MANNER
value: for sparse graphs with negative edges
type: OTHER
Source sentences:
text: For sparse graphs with negative edges but no negative cycles, Johnson's algorithm can be used, with the same asymptotic running time as the repeated Dijkstra approach.