Proper noun
Floyd-Warshall algorithm (computer science, graph theory) An algorithm for finding shortest paths in a weighted graph with positive or negative edge weights (but with no negative cycles).