Bellman-Ford Shortest Path

Finds shortest paths from a source even with negative edges by relaxing all edges V−1 times, and detects negative cycles.