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.
demroth 0 Light Poster
dickersonka 104 Veteran Poster
nicholasmathew 0 Newbie Poster
check out these
http://www.boost.org/doc/libs/1_36_0/libs/graph/doc/johnson_all_pairs_shortest.html
Thank you for these useful links.
Mathew
Be a part of the DaniWeb community
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.