Johnson's algorithm
English
Etymology
Published in 1977 by Donald B. Johnson.
Proper noun
- (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 licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.