|
From: Joris K. <de...@gm...> - 2011-04-12 22:17:59
|
Hey, It's easier if you post some more information about your graph. Some functions/classes that might come in handy for you: -Graphs.getOppositeVertex(Graph<V,E> g, E e, V v): Gets the vertex opposite another vertex across an edge. -Graph.getNeighbors() Also, check the depthFirstIterator. Besides that, you should be a bit more specific about your graph, type of graph, properties like cyclic/simple/etc. Perhaps some short code snippets. br, Joris On Sun, Apr 10, 2011 at 11:46 AM, Peter Wilkinson <pro...@gm...> wrote: > Hi, I'm working on a js dependency management project. I've been pointed at > JGraphT which seems to offer a lot of handy stuff. > > However I'm having trouble finding the specific info I want which is how I > can retrieve the vertexes in dependency order from a given starting node. > > e.g. I have a tree with 3 Vertexes A => B, B => C, A => C > > I want to iterate through the vertexes in order of A, B, C. I'm finding I > get results like A, C, B. > > Cheers, > > Pete > > ------------------------------------------------------------------------------ > Xperia(TM) PLAY > It's a major breakthrough. An authentic gaming > smartphone on the nation's most reliable network. > And it wants your games. > http://p.sf.net/sfu/verizon-sfdev > _______________________________________________ > jgrapht-users mailing list > jgr...@li... > https://lists.sourceforge.net/lists/listinfo/jgrapht-users > > |
