Johnson's algorithm

== English == === Etymology === Published in 1977 by Donald B. Johnson. === Proper noun === Johnson's algorithm (graph theory) An algorithm for finding the shortest paths between all pairs of vertices in an edge-weighted directed graph.