ml-floyd-warshall

Algorithm for finding shortest paths in a weighted graph with positive or negative edge weights (but with no negative cycles)