Johnson's algorithm

proper noun

An algorithm for finding the shortest paths between all pairs of vertices in an edge-weighted directed graph.

Ask AI about this wordChatGPTClaudePerplexityGoogle AIGrok

Meanings

proper noun
  1. graph theoryAn algorithm for finding the shortest paths between all pairs of vertices in an edge-weighted directed graph.

Origin

Published in 1977 by Donald B. Johnson.

Full word history & related roots →
Cite this entry
APA

Johnson's algorithm. (n.d.). In WatkinsX Dictionary. Retrieved November 3, 2026, from https://dictionary.watkinsx.com/word/Johnson's%20algorithm

MLA

“Johnson's algorithm.” WatkinsX Dictionary, https://dictionary.watkinsx.com/word/Johnson's%20algorithm. Accessed November 3, 2026.

Chicago

WatkinsX Dictionary, s.v. “Johnson's algorithm,” accessed November 3, 2026, https://dictionary.watkinsx.com/word/Johnson's%20algorithm.

Source: Johnson's algorithm on Wiktionary, CC BY-SA 4.0.