the resolver to stop when all the neighbours of the starting
vertex have been visited as opposed to going through the whole
graph.
PR:
Obtained from:
Submitted by:
Reviewed by:
git-svn-id: https://svn.apache.org/repos/asf/jakarta/commons/sandbox/graph/trunk@144587 13f79535-47bb-0310-9956-ffa450edef68
should represent types. It also makes the UML diagrams very hard
to follow. We're just going to use the fully qualified GraphConstants.{x}
idiom.
. Added the Graphable interface to allow any arbitrary object to be
manipulated like a vertex in a graph.
. Added a util package that has a dependency resolver that uses a depth first
search to sort the dependencies for a set of objects that implement
the Graphable interface. The resolver also works with Strings and
lists and deps stated as lists of strings so I can resuse the test
I wrote for the DependencyEngine in jjar.
PR:
Obtained from:
Submitted by:
Reviewed by:
git-svn-id: https://svn.apache.org/repos/asf/jakarta/commons/sandbox/graph/trunk@144586 13f79535-47bb-0310-9956-ffa450edef68
jvanzyl