Johnson's algorithm - Wiktionary, the free dictionary
Article Images
Published in 1977 by Donald B. Johnson.
- (graph theory) An algorithm for finding the shortest paths between all pairs of vertices in an edge-weighted directed graph.
Published in 1977 by Donald B. Johnson.