Java graph library

Here’s a fairly generic graph library I wrote in Java, along with a few tests. This implements Dijkstra’s, Bellman-Ford, Floyd-Warshall, Edmonds-Karp, strongly connected components and a few other routines. The tests are not comprehensive but I’m fairly confident in the code.

Posted in Java at January 12th, 2010. 9,596 Comments.