Floyd-Warshall algorithm

proper noun

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

Meanings

proper nounthe Floyd-Warshall algorithm
  1. computerAn algorithm for finding shortest paths in a weighted graph with positive or negative edge weights (but with no negative cycles).

Origin

Named after Robert W. Floyd and Stephen Warshall.

Full word history & related roots →
Cite this entry
APA

Floyd-Warshall algorithm. (n.d.). In WatkinsX Dictionary. Retrieved November 2, 2026, from https://dictionary.watkinsx.com/word/Floyd-Warshall%20algorithm

MLA

“Floyd-Warshall algorithm.” WatkinsX Dictionary, https://dictionary.watkinsx.com/word/Floyd-Warshall%20algorithm. Accessed November 2, 2026.

Chicago

WatkinsX Dictionary, s.v. “Floyd-Warshall algorithm,” accessed November 2, 2026, https://dictionary.watkinsx.com/word/Floyd-Warshall%20algorithm.

Source: Floyd-Warshall algorithm on Wiktionary, CC BY-SA 4.0.