Floyd-Warshall algorithm

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

English[edit]

Etymology[edit]

Named after Robert W. Floyd and Stephen Warshall.

Proper noun[edit]

the 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).
Retrieved from "https://en.wiktionary.org/w/index.php?title=Floyd-Warshall_algorithm&oldid=77949018"