Word.ws English Dictionary

Johnson's algorithm

Johnson's algorithm proper noun: an algorithm for finding the shortest paths between all pairs of vertices in an edge-weighted directed graph.

Proper noun

Johnson's algorithm

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

Origin of Johnson's algorithm

Published in 1977 by Donald B. Johnson.

Questions about Johnson's algorithm

What does Johnson's algorithm mean?
Johnson's algorithm means an algorithm for finding the shortest paths between all pairs of vertices in an edge-weighted directed graph.
What part of speech is Johnson's algorithm?
Johnson's algorithm is a proper noun.

Words near Johnson's algorithm in the dictionary

  1. Johnson polyhedron
  2. Johnson polyhedrons
  3. Johnson solid
  4. Johnson solids
  5. Johnson thermoelectric energy converter
  6. Johnson's algorithm
  7. Johnson's rule
  8. Johnson-Lindenstrauss lemma
  9. Johnson-McMillin syndrome
  10. Johnson-Munson syndrome
  11. Johnson-Nyquist noise

Source and license

Adapted from Wiktionary: Johnson's 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: “Johnson's algorithm.” Word.ws, https://word.ws/johnson%27s_algorithm. Based on Wiktionary, CC BY-SA 4.0.