floyd-warshall algorithm

Fetched 2026-10-26 (cache).

Datamuse reports no synonyms or antonyms for this word.

Proper noun

1. {{lb|en|algorithm|graph theory}} An algorithm for finding shortest paths in a [[weighted graph]] with positive or negative edge weights (but with no negative cycles).

Source: Wiktionary · CC BY-SA 4.0 (Wiktionary dump) · cached copy, not a rewrite.