Floyd-Warshall algorithm

From Wiktionary, the free dictionary
Jump to navigation Jump to search



Named after Robert W. Floyd and Stephen Warshall.

Proper noun[edit]

Floyd-Warshall algorithm

  1. (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).