Johnson's algorithm - Wiktionary, the free dictionary


Article Images

Published in 1977 by Donald B. Johnson.

Johnson's algorithm

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