Floyd-Warshall algorithm
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).
Proper noun
the Floyd-Warshall algorithm
- An algorithm for finding shortest paths in a weighted graph with positive or negative edge weights (but with no negative cycles).
Origin of Floyd-Warshall algorithm
Named after Robert W. Floyd and Stephen Warshall.
Questions about Floyd-Warshall algorithm
- What does Floyd-Warshall algorithm mean?
- Floyd-Warshall algorithm means an algorithm for finding shortest paths in a weighted graph with positive or negative edge weights (but with no negative cycles).
- What part of speech is Floyd-Warshall algorithm?
- Floyd-Warshall algorithm is a proper noun.
Words near Floyd-Warshall algorithm in the dictionary
Source and license
Adapted from Wiktionary: Floyd-Warshall algorithm (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.
Last updated:
Cite this entry: “Floyd-Warshall algorithm.” Word.ws, https://word.ws/floyd-warshall_algorithm. Based on Wiktionary, CC BY-SA 4.0.
