Hi Jochen, not sure this will meet your needs, but check out this: http://ebuilder.svn.sourceforge.net/viewvc/ebuilder/trunk/net.sf.ebuilder/src/net/sf/ebuilder/utilities/TopologicalSort.java?view=markup
A usage example can be found here: http://ebuilder.svn.sourceforge.net/viewvc/ebuilder/trunk/net.sf.ebuilder/src/net/sf/ebuilder/utilities/BuildOrderUtility.java?view=markup HTH, Mirko On Tue, Feb 26, 2013 at 3:24 AM, Jochen Wiedmann <jochen.wiedm...@gmail.com>wrote: > Hi, > > has anyone here written, or can anyone recommend, a Java Open Source > library, that allows to > > - Create a dependency graph and > - Detect circular dependencies, if any > - Resolve it (retrieve the graph nodes one by one in a manner that every > retrieved node is independent > of the remaining graph, assuming absence of circular dependencies) > > Thanks, > > Jochen > > > -- > "That's what prayers are ... it's frightened people trying to make friends > with the bully!" > > Terry Pratchett. The Last Hero >
