JDigraph
JDigraph is a Java library for representing and working with directed graphs and paths. The API is patterned after the Java Collections API.
| Tags | Scientific/Engineering Software Development Libraries |
|---|---|
| Licenses | BSD Original |
| Operating Systems | OS Independent |
| Implementation | Java |
Recent releases
- 24 Aug 2002 12:50
Changes: This release fixes naming for CE things in net.walend.measured, puts versioning info into .jar files, adds tests for the shortest paths on sparse graphs, gains some confidence in Johnson's algorithm (there still might be a flaw in it, possibly in the heap implementation), and uses property files for properties in the build.
- 19 Feb 2002 16:04
Changes: toString() methods now print cyclic paths correctly. A measured path package ,IntHeap and an implementation of Fibonacci heaps with int keys, index-based methods for matrix digraphs, and digraphs optimized for Dijkstra's and Bellman-Ford's algorithm have been added. Floyd-Warshall's and Johnson's algorithm is working to fill up a DigraphOfCEPaths subclass. Special implementations of ShortestCEPaths have been added for Floyd-Warsahll's, Bellman-Ford's, and Johnson's algorithms, as well as one that performs Dijkstra's just-in-time.
- 06 Dec 2001 16:40
Changes: This release is an API release candidate. After this release, all attempts will be made to avoid changing the exising API (although adding is still OK). So if you aren't happy with method names, now is the time to speak up.
- 22 Nov 2001 17:44
No changes have been submitted for this release.
