Shortest paths through a graph

Bellman-Ford algorithm to find the shortest paths through a graph with
negative edge lengths