A directed cycle in an edge-weighted graph whose total weight is negative. Repeating it makes walk costs arbitrarily small. For a particular shortest-path distance to be affected, the cycle must be reachable from and must have a route to ; an unrelated component does not change that distance.
New to topics? Read the docs here!