- applying patches submitted by David Dixon-Peugh:
I've moved some over. (Its still in the org/apache/commons/graph
package.)
I added a package "algo" off of the graph package. This is designed
to hold various graph algorithms. Graphs have lots of neet things
you can do with them, unfortunately, they don't really fit neatly
into a nice OO design. (At least I can't see a good connection.)
Changes:
Edge.java
WeightedEdge.java
(org/apache/commons/graph)
These two classes were changed to implement Comparable. This allows
them to be sorted, and to be dropped into a PriorityQueue.
New Files:
DirectedGraph.java
UndirectedGraph.java
(org/apache/commons/graph)
There are some algorithms which demand either Directed or Undirected
graphs. These classes allow us to have static type checking for those
algorithms.
Label.java
(org/apache/commons/graph)
There are many algorithms in graph theory which require a marking of
groups. This label basically has some pointers which it snaps whenever
it is referenced. It brings running times of some algorithms down close
to O(V + E) rather than O(VlgV + E).
MinimumSpanningForest.java
(org/apache/commons/graph/algo)
This file implements a MinimumSpanningForest algorithm over any graphs.
It uses a PriorityQueue from org/apache/commons/collection.
Sort.java
(org/apache/commons/graph/algo)
This file implements a Topological Sort on directed graphs. It has some
problems if there is a back edge in the graph. (Currently it ignores
back edges. I hope to have it throw a BackEdgeException in the future.)
BackEdges.java
(org/apache/commons/graph/algo)
This file identifies back edges in a Directed Graph, when starting from
a particular vertex.
GraphException.java
BackEdgeException.java
(org/apache/commons/graph/exception)
These are basic exceptions that can be thrown from the graph package.
TestBackEdges.java
TestSort.java
TestMinimumSpanningTree.java
These are JUnit tests for the algorithms provided in this package.
No tests are provided for the Exceptions, Label, Directed and Undirected
classes (Although Label really should have one. If Label isn't
working, you get some really nasty bugs.)
--------------------------
Well, this should keep you busy for a while.
Let me know if there are any changes you would like me to make.
DDP
PR:
Obtained from:
Submitted by:
Reviewed by:
git-svn-id: https://svn.apache.org/repos/asf/jakarta/commons/sandbox/graph/trunk@144589 13f79535-47bb-0310-9956-ffa450edef68
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