\b[Bellman–Ford permits negative edge weights], and can detect a reachable negative-weight cycle. The usual settled-label <Dijkstra's algorithm> requires nonnegative weights for its correctness argument. Negative edges are not themselves a problem for Bellman–Ford when no relevant negative cycle exists.

Solution

Past exam of the year 1 of the computer science course of the University of Oxford / 2017 / Functional programming, design and analysis of algorithms (resit) / 5 / c / Solution

 Solution (source code)