Johnson's algorithm is a graph algorithm for finding the shortest paths between all pairs of vertices in a weighted directed graph.