johnson's algorithm

Fetched 2026-10-26 (cache).

Datamuse reports no synonyms or antonyms for this word.

Proper noun

1. {{lb|en|graph theory}} An algorithm for finding the shortest [[path]]s between all [[pair]]s of [[vertex|vertices]] in an edge-weighted [[directed graph]].

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