Jump to content

Johnson's algorithm

From Wiktionary, the free dictionary

English

[edit]
English Wikipedia has an article on:
Wikipedia

Etymology

[edit]

Published in 1977 by Donald B. Johnson.

Proper noun

[edit]

Johnson's algorithm

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