[jasebell]

Definitely worth looking at, the Bellman-Ford algorithm can traverse negative edges but is slower than Dijkstra's.

An interesting read!