Finish testing reweighting function for Johnson

-added small test case for the reweighting function of Johnson’s
algorithm using Bellman-Ford to compute the shortest path from a
psuedo-node with path length 0 to each vertex in a graph.
-added a few iterators to DirectedGraph object to make things less
cluttered.