We should have an implementation of Bellman-Ford for when we need to find a shortest path in a graph with negative edges.