Johnson's algorithm

Johnson's algorithm

English

Etymology

Published in 1977 by Donald B. Johnson.

Proper noun

Johnson's algorithm

  1. (graph theory) An algorithm for finding the shortest paths between all pairs of vertices in an edge-weighted directed graph.
This article is issued from Wiktionary. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.