[Openjgraph-development] Small changes in CVS

[Jesus M. S. Jr. <jm...@ih...>]

To anybody interested, I have made some small changes to into the CVS:

Both minimumSpanningTree and shortestPath now return a WeightedGraph
instead of a Vector of Edges. However, these required some changes
within Graph ( and GraphImpl, etc.. ). 

The reason for doing this is that a spanning tree IS a tree ( and
therefore a graph ). The other more compelling reason is to allow the
subgraph to be "highlighted" on the main graph, visually ... therefore
allowing to visually see the actual minimum spanning tree and shortest
path spanning tree of a graph.

We also therefore need some operation to test if a graph is a subgraph
of another graph by comparing all the edges and vertices in the subgraph
against the other graph.

I will work on these on the next few days.



John

-- 
Homepage: http://homepages.tig.com.au/~jmsalvo/