Johnson's algorithm is a way to find shortest paths between all pairs of vertices in a sparse directed graph. The problem is I can not seem to find any good documentation on it nor any code to analyze. I have been to Wikipedia, read some algorithm books and some power point files I have found on the web. All seem to describe this algorithm differently. Does anyone know of a good source of information/documentation or C++ code I can look at.