Floyd-Warshall algorithm

Today it means: An algorithm for finding shortest paths in a weighted graph with positive or negative edge weights (but with no negative cycles). Full definition →