Johnson's algorithm

From Wiktionary, the free dictionary

Jump to navigation Jump to search

English[edit]

English Wikipedia has an article on:

Johnson's algorithm

Etymology[edit]

Published in 1977 by Donald B. Johnson.

Proper noun[edit]

Johnson's algorithm

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

Retrieved from "https://en.wiktionary.org/w/index.php?title=Johnson%27s_algorithm&oldid=63716343"

Hidden category:

English entries with language name categories using raw markup