Revision as of 03:42, 1 November 2009 edit Twexcom (talk \| contribs) 103 edits →External Links ← Previous edit		Revision as of 06:13, 1 November 2009 edit undo David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,645 edits →External Links: new boost library link is ok. DANN is not: not only has it been spammed recently, but it is not a good algorithm. Will expand in talk. Next edit →
Line 39: == External Links == *[http://www.boost.org/doc/libs/1_40_0/libs/graph/doc/johnson_all_pairs_shortest.html Boost: All Pairs Shortest Paths]▼ ▲[http://www.boost.org/doc/libs/1_40_0/libs/graph/doc/johnson_all_pairs_shortest.html Boost: All Pairs Shortest Paths] [http://wiki.syncleus.com/index.php/DANN Open Source Java AI Library with Implementation] ([http://bugs.syncleus.com/trac.cgi/dANN/browser/trunk/projects/java_dann/src/com/syncleus/dann/graph/search/pathfinding/JohnsonGraphTransformer.java source])

Johnson's algorithm: Difference between revisions