jgrapht-users — JGraphT user list.

Re: [jgrapht-users] check out GrALoG

[John V. S. <js...@gm...>]

Sebastian Ordyniak wrote:
> hi,
> 
> there are layoutalgorithms. You find them under Tools->Open 
> structureLayoutAlgorithmDialog.
> I know the screenshots do not work at the moment. I will fix that soon.
> Do also have a look at 
> http://gralog.sourceforge.net/doc/website/index.html for documentation about
> the GUI.

Oh, very nice...the layouts are great!

JVS

Re: [jgrapht-users] check out GrALoG

[Sebastian O. <sor...@go...>]

hi,

there are layoutalgorithms. You find them under Tools->Open
structureLayoutAlgorithmDialog.
I know the screenshots do not work at the moment. I will fix that soon.
Do also have a look at
http://gralog.sourceforge.net/doc/website/index.htmlfor documentation
about
the GUI.

cheers
Sebastian

2008/10/2 John V. Sichi <js...@gm...>

> This project puts JGraphT to use in some interesting ways.
>
> http://gralog.sourceforge.net/index.html
>
> The plugin tree requires a bit of experimentation to figure out how it
> works; here are some example steps:
>
> 1.  From Gralog-Core-Plugin, choose the
> LabeledSimpleUndirectedGraphStructure.  Use the "Add Node" and "Add Edge"
> toolbar buttons to create a graph structure in the canvas to the right.
>
> 2.  From the Examples plugin, choose ShortestPathInteractive under the
> algorithms folder, then select the document you created in step 1 as the
> structure.  Then click Execute Algorithm.  You'll be prompted to select the
> start and finish vertices, which will cause the shortest path to be
> highlighted.  Nice!
>
> The graph generators work too, but there's no layout algorithm, so all of
> the nodes come out on top of each other...need to integrate graphviz or
> JGraph algorithms there.
>
> JVS
>

[jgrapht-users] check out GrALoG

[John V. S. <js...@gm...>]

This project puts JGraphT to use in some interesting ways.

http://gralog.sourceforge.net/index.html

The plugin tree requires a bit of experimentation to figure out how it 
works; here are some example steps:

1.  From Gralog-Core-Plugin, choose the 
LabeledSimpleUndirectedGraphStructure.  Use the "Add Node" and "Add 
Edge" toolbar buttons to create a graph structure in the canvas to the 
right.

2.  From the Examples plugin, choose ShortestPathInteractive under the 
algorithms folder, then select the document you created in step 1 as the 
structure.  Then click Execute Algorithm.  You'll be prompted to select 
the start and finish vertices, which will cause the shortest path to be 
highlighted.  Nice!

The graph generators work too, but there's no layout algorithm, so all 
of the nodes come out on top of each other...need to integrate graphviz 
or JGraph algorithms there.

JVS

[jgrapht-users] JGraphT Version 0.8.0 Released

[John V. S. <js...@gm...>]

The version number has jumped to 0.8 because JGraphT now requires Java 
1.6 at both buildtime and runtime.  This was necessary so that we could 
start using ArrayDeque, which speeds up the iterators and some of the 
algorithms.  If you are stuck on an earlier JVM/JDK, either continue to 
use the JGraphT 0.7.x series until you can make the move, or use 
retroweaver/translator to create a backport.

Some news:  JGraphT has moved under the umbrella of The Eigenbase 
Project, another open source organization I am actively involved in. 
The project is accepting donations, and those are tax deductible because 
Eigenbase is a 501(c)(3) public charity.  Contributions will be used to 
set up hosted services such as Cruise Control and code coverage 
reporting in order to keep JGraphT quality high.  If you use JGraphT in 
your application, please consider making a donation today; JGraphT is 
entirely volunteer supported.  Donation links are available at 
http://www.eigenbase.org as well as on the JGraphT donation page at 
Sourceforge.  Note that JGraphT links have not moved, and hosting is 
still at Sourceforge.net.  If you have questions about any of this, 
please let me know.

Thanks, and now back to the usual release announcement!

This release includes a number of bugfixes and contributions which have 
accumulated since the 0.7.3 release. You can find a description of the 
changes here:

http://jgrapht.wikispaces.com/Release0.8.0

Big thanks to all who made suggestions and code contributions for this 
release, especially Tim Shearouse, Ilya Razenshteyn and Peter Giles for 
new algorithm implementations, plus Jason Lenderman and Ross Judson for 
performance improvements.

JVS

Re: [jgrapht-users] [Fwd: dynamic DAG implementation, DirectedAcyclicGraph.java]

[Peter G. <gilesp@u.washington.edu>]

Excellent!  I'm very pleased to be able to contribute.  The
BitSet suggestion is a good one, an obvious winner.  Wish I had
thought of it ;)

Cheers, 
Peter

On Sun, 17 Aug 2008 01:22:45 -0700, "John V. Sichi"
<js...@gm...> said:
> John V. Sichi wrote:
> > Thanks Peter, this is a really useful contribution.  I'll work on
> > including it in the next release; in the meantime, I'm cc'ing it
> > to jgrapht-users in case anyone wants to make use of the code
> > before then.
>
> I have checked this into Subversion under new package
> org.jgrapht.experimental.dag, which is where it will go for the 0.7.4
> release.  After that, it can move out of experimental once we've
> determined the best place for the various interfaces (we don't
> currently have a pattern of a constrained graph within JGraphT, so we
> might want to add infrastructure for the constraint concept
> generically first).
>
> Also, I'm thinking that a java.util.BitSet could provide a good
> implementation for the Visited interface (1/8 the memory of a
> boolean array).
>
> JVS

Re: [jgrapht-users] [Fwd: dynamic DAG implementation, DirectedAcyclicGraph.java]

[John V. S. <js...@gm...>]

John V. Sichi wrote:
> Thanks Peter, this is a really useful contribution.  I'll work on 
> including it in the next release; in the meantime, I'm cc'ing it to 
> jgrapht-users in case anyone wants to make use of the code before then.

I have checked this into Subversion under new package 
org.jgrapht.experimental.dag, which is where it will go for the 0.7.4 
release.  After that, it can move out of experimental once we've 
determined the best place for the various interfaces (we don't currently 
have a pattern of a constrained graph within JGraphT, so we might want 
to add infrastructure for the constraint concept generically first).

Also, I'm thinking that a java.util.BitSet could provide a good 
implementation for the Visited interface (1/8 the memory of a boolean 
array).

JVS

[jgrapht-users] new ScaleFreeGraphGenerator and EdmondsKarpMaximumFlow

[John V. S. <js...@gm...>]

Ilya Rasenstein has contributed these; you can get them from Subversion, 
and they'll be available in the 0.7.4 release.  Attached is a graphviz 
rendering for a 50-node output from ScaleFreeGraphGenerator.

JVS

[jgrapht-users] a problem with visualization of graph

[Amirali S. <ami...@gm...>]

Hello everyone,

I am using JgraphT for a project. I encountered to a bug which I couldn't
solve it yet, so any help is greatly appreciated :).
I have a randomly created graph consisting of almost 100 nodes and 2000
edges. Concisely, my code is adding/eliminating some edges during the
execution. I am using JGraphModelAdaptor.class to visualize the graph by
Jgraph. Interestingly, I get the following exception during the execution of
code:
Exception in thread "main" java.lang.NullPointerException
at org.jgraph.graph.EdgeRenderer.createShape(Unknown Source)
at org.jgraph.graph.EdgeView.getShape(Unknown Source)
at org.jgraph.graph.EdgeRenderer.getPaintBounds(Unknown Source)
at org.jgraph.graph.EdgeRenderer.getBounds(Unknown Source)
at org.jgraph.graph.EdgeView.getBounds(Unknown Source)
at org.jgraph.JGraph.getCellBounds(Unknown Source)
at org.jgraph.JGraph.getCellBounds(Unknown Source)
at
org.jgraph.plaf.basic.BasicGraphUI$GraphSelectionHandler.valueChanged(Unknown
Source)
at org.jgraph.graph.DefaultGraphSelectionModel.fireValueChanged(Unknown
Source)
at org.jgraph.graph.DefaultGraphSelectionModel.notifyCellChange(Unknown
Source)
at org.jgraph.graph.DefaultGraphSelectionModel.setSelectionCells(Unknown
Source)
at org.jgraph.JGraph.setSelectionCells(Unknown Source)
at org.jgraph.plaf.basic.BasicGraphUI$GraphModelHandler.graphChanged(Unknown
Source)
at org.jgraph.graph.DefaultGraphModel.fireGraphChanged(Unknown Source)
at org.jgraph.graph.DefaultGraphModel$GraphModelEdit.execute(Unknown Source)
at org.jgraph.graph.DefaultGraphModel.insert(Unknown Source)
at
org.jgrapht.ext.JGraphModelAdapter.internalInsertCell(JGraphModelAdapter.java:819)
at
org.jgrapht.ext.JGraphModelAdapter.handleJGraphTAddedEdge(JGraphModelAdapter.java:681)
at
org.jgrapht.ext.JGraphModelAdapter$JGraphTListener.edgeAdded(JGraphModelAdapter.java:1086)
at
org.jgrapht.graph.DefaultListenableGraph.fireEdgeAdded(DefaultListenableGraph.java:317)
at
org.jgrapht.graph.DefaultListenableGraph.addEdge(DefaultListenableGraph.java:168)
at simulator.Network.connect(Network.java:39)
at simulator.Simulator.processMessages(Simulator.java:257)
at simulator.Simulator.messagesWorker(Simulator.java:178)
at simulator.Simulator.run(Simulator.java:311)
at java.lang.Thread.run(Unknown Source)
at simulator.Simulator.main(Simulator.java:339)

Some interesting issues according to this bug are:

1 - I don't have this bug in creation of graph - to my understanding, the
edges in jgrapht are added to jgraph with  *handleJGraphTAddedEdge* method.
This method has been used in creation of graph(in constructor of
JGraphModelAdaptor), and  when the new edge is added to jgrapht (in *
edgeAdded* method). Surprisingly, I am getting this bug just when the graph
is changing during the execution of code, not in creation of graph.
2 - If I change the parameters of graph(number of nodes and edges) which
results in less numbers of deletions and additions of edges during the
execution of code, I will not get this bug...

I would greatly appreciate it if anyone help me in this regard,
All the best,
Amirali

[jgrapht-users] say hi at OSCON

[John V. S. <js...@gm...>]

I'll be at OSCON in Portland, Oregon in July.  I'll be giving a talk on 
another open-source project I work on (LucidDB), but if you're going to 
be there too and want to chat about JGraphT, email me and we can meet up.

http://en.oreilly.com/oscon2008/public/schedule/detail/2781

JVS

Re: [jgrapht-users] Problem with libraries

[John V. S. <js...@gm...>]

Hi Jakub,

You must be picking up an old (pre-0.7) version of JGraphT.  Please 
download the latest (0.7.3) from

http://sourceforge.net/projects/jgrapht

See also:

http://jgrapht.wikispaces.com/MigrationTo0.7

JVS

Jakub Rojek wrote:
> Hello!
> 
> I have found a code for demo for JGrapht graph visualization using the 
> JGraph library ( http://jgrapht.sourceforge.net/visualizations.html ). 
> Before I had run the demo i had downloaded and imported the  JGraph and 
> JGrapht libraries to my project.  The problem is that i can not find the 
> following files in the libraries. The following list includes packages 
> missing in the libraries:
> import org.jgrapht.ListenableGraph;
> import org.jgrapht.ext.JGraphModelAdapter;
> import org.jgrapht.graph.ListenableDirectedGraph;
> import org.jgrapht.graph.DefaultEdge;
> 
> The funny thing is that this org.jgrapht is described in the api of 
> JGrapht but i can not find it in the jars that i have found on the website.
> 
> Greetings
> 
> 
> -------------------------------------------------------------------------
> This SF.net email is sponsored by: Microsoft 
> Defy all challenges. Microsoft(R) Visual Studio 2008. 
> http://clk.atdmt.com/MRT/go/vse0120000070mrt/direct/01/
> _______________________________________________
> jgrapht-users mailing list
> jgr...@li...
> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
> 

[jgrapht-users] Problem with libraries

[Jakub R. <ro...@ii...>]

Hello!

I have found a code for demo for JGrapht graph visualization using the 
JGraph library ( http://jgrapht.sourceforge.net/visualizations.html ). 
Before I had run the demo i had downloaded and imported the  JGraph and 
JGrapht libraries to my project.  The problem is that i can not find the 
following files in the libraries. The following list includes packages 
missing in the libraries:
import org.jgrapht.ListenableGraph;
import org.jgrapht.ext.JGraphModelAdapter;
import org.jgrapht.graph.ListenableDirectedGraph;
import org.jgrapht.graph.DefaultEdge;

The funny thing is that this org.jgrapht is described in the api of 
JGrapht but i can not find it in the jars that i have found on the website.

Greetings

[jgrapht-users] JGraphT on ohloh.net

[John V. S. <js...@gm...>]

I've enlisted JGraphT's Subversion repository in ohloh, a service which 
analyzes open-source projects:

http://www.ohloh.net/projects/jgrapht

It produces some fun factoids.

JVS

Re: [jgrapht-users] Accessing nodes while iterating on graph.

[John V. S. <js...@gm...>]

Jonathan Mörndal wrote:
> There might be complexity issues here, and in particular the former  
> solution might not give the direct predecessors but just all  
> predecessors. (Devs> Isn't there some ambiguity (flaw) in the docs  
> here? The graph-theoretic def. of predecessors is those nodes from  
> which the node is reachable, right?) But for any practical purpose, at  
> least the latter solution would be feasible, I believe.

You're right, the documentation in Graphs needs refinement.  At a 
minimum, I will change the Javadoc to clarify that it's the direct 
predecessor/successor.

Beyond that, I could deprecate the methods (keeping them around for a 
few releases for backwards compatibility) and introduce new ones with 
longer names like directPredecessorListOf, but maybe in this case just 
clarifying the Javadoc is good enough?

JVS

Re: [jgrapht-users] Accessing nodes while iterating on graph.

[Jonathan M. <jon...@it...>]

Why don't you use Graphs.predecessorListOf or iterate through the set  
given by DirectedGraph.incomingEdgesOf and use getEdgeSource?

There might be complexity issues here, and in particular the former  
solution might not give the direct predecessors but just all  
predecessors. (Devs> Isn't there some ambiguity (flaw) in the docs  
here? The graph-theoretic def. of predecessors is those nodes from  
which the node is reachable, right?) But for any practical purpose, at  
least the latter solution would be feasible, I believe.

/Jonathan

15 apr 2008 kl. 23.52 skrev Serge Prud'homme:

>
> Greetings,
>
> I recently discovered JGraphT and I have the following problem.
>
> I need to do a project management tool which means I have an acyclic  
> directed graph holding the duration of each activity in each node  
> and edges between nodes representing the dependencies between the  
> actvities.
>
> example:
>
> TaskA
> duration=3
>
> TaskB
> duration=4
>
> TaskC
> duration=5
>
> TaskD
> duration=6
>
> TaskA --> TaskC
> TaskB --> TaskC
> TaskC --> TaskD
>
>
> I want to do a traversal of the graph and for each node update a  
> "leadTime" member to each node indicating the minimum time for the  
> availability of each task.
> The lead time can be expressed as follow: the maximum leadTime of  
> all the direct ancestors + task duration.
>
>
> TaskA
> duration =3
> leadTime=3
>
> TaskB
> duration =4
> leadTime=4
>
> TaskC
> duration =5
> leadTime=4    =max(3, 4)
>
> TaskD
> duration =5
> leadTime=9    =max(3, 4) + 5
>
>
> A TopologicalOrderIterator seems like a good fit but I cannot figure  
> out how to access the information from the previous node while  
> iterating.  The TraversalListener seemed promissing but I don't see  
> how to access the source and destination nodes from the  
> EdgeTraversalEvent.
>
> Ideas?
>
> Thanks
>
>   Serge
>
>
>
>
> between 0000-00-00 and 9999-99-99   
> -------------------------------------------------------------------------
> This SF.net email is sponsored by the 2008 JavaOne(SM) Conference
> Don't miss this year's exciting event. There's still time to save  
> $100.
> Use priority code J8TL2D2.
> http://ad.doubleclick.net/clk;198757673;13503038;p?http://java.sun.com/javaone_______________________________________________
> jgrapht-users mailing list
> jgr...@li...
> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
>

[jgrapht-users] Accessing nodes while iterating on graph.

[Serge Prud'h. <ser...@ya...>]

Greetings,

I recently discovered JGraphT and I have the following problem.

I need to do a project management tool which means I have an acyclic directed graph holding the duration of each activity in each node and edges between nodes representing the dependencies between the actvities.

example:

TaskA
 duration=3
 
TaskB
 duration=4
 
TaskC
 duration=5
 
TaskD
  duration=6
  
TaskA --> TaskC
TaskB --> TaskC
 TaskC --> TaskD
 

I want to do a traversal of the graph and for each node update a "leadTime" member to each node indicating the minimum time for the availability of each task.  
The lead time can be expressed as follow: the maximum leadTime of all the direct ancestors + task duration.


TaskA
duration =3
 leadTime=3

TaskB
 duration =4
  leadTime=4
 
TaskC
 duration =5
  leadTime=4    =max(3, 4)
 
TaskD
  duration =5
   leadTime=9    =max(3, 4) + 5
  

A TopologicalOrderIterator seems like a good fit but I cannot figure out how to access the information from the previous node while iterating.  The TraversalListener seemed promissing but I don't see how to access the source and destination nodes from the EdgeTraversalEvent. 

Ideas?

Thanks

  Serge





 between 0000-00-00 and 9999-99-99        

Re: [jgrapht-users] source code for examples

[John V. S. <js...@gm...>]

Agile Aspect wrote:
> Hi - would some point me to an archive file containing the
> the source code for the examples on
> 
>     http://jgrapht.wikispaces.com
> 
> When I right click on these links, I end up downloading the copies
> of the web pages.

The examples are intended to be short snippets so that you can use copy 
and paste if you actually want to compile them.  But mainly they are 
there just for browsing example usage patterns, which is why we don't 
redundantly maintain them in the distribution.

Of course, that means they may break occasionally with new versions, but 
the nice part about wiki is that anyone can fix them :)

> Also, displaying Java source code in black type on a gray background
> should be strongly discouraged simply because it's optimized for low
> contrast. 

These are using the default Java colorization provided by wikispaces, so 
you might want to send in your feedback here:

http://www.wikispaces.com/help+index

(BTW, I agree with you.)

JVS

[jgrapht-users] source code for examples

[Agile A. <agi...@gm...>]

Hi - would some point me to an archive file containing the
the source code for the examples on

    http://jgrapht.wikispaces.com

When I right click on these links, I end up downloading the copies
of the web pages.

Also, displaying Java source code in black type on a gray background
should be strongly discouraged simply because it's optimized for low
contrast. 

In addition, it would be extremely helpful to new comers if these examples
were included the distribution file in an examples directory.

Thank you!

-- 
Article. VI. Clause 3 of the constitution of the United States states: 

"The Senators and Representatives before mentioned, and the Members of 
the several State Legislatures, and all executive and judicial Officers, 
both of the United States and of the several States, shall be bound by 
Oath or Affirmation, to support this Constitution; but no religious Test 
shall ever be required as a Qualification to any Office or public Trust 
under the United States." 

[jgrapht-users] [Fwd: dynamic DAG implementation, DirectedAcyclicGraph.java]

[John V. S. <js...@gm...>]

Thanks Peter, this is a really useful contribution.  I'll work on 
including it in the next release; in the meantime, I'm cc'ing it to 
jgrapht-users in case anyone wants to make use of the code before then.

JVS

-------- Original Message --------
Subject: dynamic DAG implementation, DirectedAcyclicGraph.java
Date: Mon, 17 Mar 2008 12:06:29 -0700
From: Peter Giles <gi...@wa...>
To: per...@us...

Hello JGraphT folks,

I implemented a dynamic directed acyclic graph using JGraphT as part of
another project I am working on, and thought I would submit it in case
you would like to include it in your library.  Please let me know if you
have any questions, or would like additional information.

The unit tests are not exhaustive, but were sufficient for my uses.  I
have found JGraphT both useful and enjoyable to work with, and I would
feel good about providing something back to the project.

Best regards,

Peter Giles
Software Engineer, Network Tools Group
University of Washington

Re: [jgrapht-users] Bounded out-degree digraphs

[John V. S. <js...@gm...>]

Hi Jonathan,

See this thread for the background:

http://sourceforge.net/mailarchive/forum.php?thread_name=000201c67294%241e41e8c0%240300a8c0%40neo&forum_name=jgrapht-developers

If you don't care about performance for random-access to successors, or 
if you can amortize by always accessing all of the successors together, 
then you can get away with no changes by using

Graphs.successorListOf(g, v)

For anything better, we would need to define the OrderableGraph 
interface mentioned in the thread above, and then implement it by 
exposing the (currently hidden) listiness in DirectedEdgeContainer via 
the corresponding List-based interfaces.

The way things are defined may seem silly if you only look at the 
in-memory graph representation, but if you consider that the Graph 
interface can be just as well implemented via SQL queries against a 
RDBMS schema, then it may make more sense (maintaining a deterministic 
edge ordering there might not be practical depending on the schema).

JVS

Jonathan Mörndal wrote:
> I'd like to use the JGraphT library as a basis for a prototype in my  
> research on pointer analysis for linked data structures, but I'd like  
> to tailor the implementation to fit my needs. Specifically, I'd like  
> to deal with digraphs that have at most k successors, and I'd like to  
> distinguish between successor 0, 1, 2 and so forth. Even more  
> specifically, I'd like to have a method getSuccessor(V vertex, int i)  
> that returns the i:th successor of vertex. I tried to prod about in  
> the AbstractBaseGraph, but I got lost in the DirectedEdgeContainer. As  
> I understand it, there is the place to extend to achieve my goal, but  
> incoming and outgoing are Sets, so how do I do this the best way?
> 
> Or is the way to go the extremely ugly one, namely using  
> DirectedWeightedGraph and just mine the outGoingEdges for the edge  
> with the correct weight (letting the weights symbolise the number of  
> the successor). It seems like such a sad abuse of an otherwise  
> extrordinary framework...
> 
> Regards
> Jonathan
> 

Re: [jgrapht-users] DepthFirstIterator - Skip and move to next branch?

[Michael Z. <li...@in...>]

John V. Sichi wrote:
> For a tree, the semantics are unambiguous.  But what about a DAG?

DAG = directed graph? If so, you are right. For anything more complex
than a tree, "sub"-elements can not be determined reliably.

Yet, any other ideas how to do this with jgrapht? Currently, here I do
use some recursive function calls with "for each child: call
recursively). Pretty ugly.

cu, Michael

[jgrapht-users] Bounded out-degree digraphs

[Jonathan M. <jon...@it...>]

I'd like to use the JGraphT library as a basis for a prototype in my  
research on pointer analysis for linked data structures, but I'd like  
to tailor the implementation to fit my needs. Specifically, I'd like  
to deal with digraphs that have at most k successors, and I'd like to  
distinguish between successor 0, 1, 2 and so forth. Even more  
specifically, I'd like to have a method getSuccessor(V vertex, int i)  
that returns the i:th successor of vertex. I tried to prod about in  
the AbstractBaseGraph, but I got lost in the DirectedEdgeContainer. As  
I understand it, there is the place to extend to achieve my goal, but  
incoming and outgoing are Sets, so how do I do this the best way?

Or is the way to go the extremely ugly one, namely using  
DirectedWeightedGraph and just mine the outGoingEdges for the edge  
with the correct weight (letting the weights symbolise the number of  
the successor). It seems like such a sad abuse of an otherwise  
extrordinary framework...

Regards
Jonathan

Re: [jgrapht-users] DepthFirstIterator - Skip and move to next branch?

[John V. S. <js...@gm...>]

For a tree, the semantics are unambiguous.  But what about a DAG?

JVS

Michael Zimmermann wrote:
> Hi there!
> 
> for a project I use jgrapht as library to store information about
> parent-child relationships. Thanks a lot for this great library!
> 
> One issue I could not solve myself is related to DepthFirstIteration.
> 
> Assume the following graph:
> A->B->C-D->E
> A->X->Y->Z
> 
> I want to iterate over all items in my graph depth first. If a certain
> condition is true, the rest of the current branch should be skipped and
> the iterator should continue with the next branch.
> 
> In my example, the iterator would go as follows:
> 1) A->X->Y (condition fulfilled; skip Z)
> 2) B->C->D->E
> 
> Is there an easy way how to solve this? Any option like:
> 
> DepthFirstIterator it = new ...
> while (it.hasNext()) {
>   MyObject o = it.next();
>   if (o.condition == true)
>      it.nextBranch()
> 
> 
> thanks and cu, Michael
> 
> -------------------------------------------------------------------------
> This SF.net email is sponsored by: Microsoft
> Defy all challenges. Microsoft(R) Visual Studio 2008.
> http://clk.atdmt.com/MRT/go/vse0120000070mrt/direct/01/
> _______________________________________________
> jgrapht-users mailing list
> jgr...@li...
> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
> 

[jgrapht-users] DepthFirstIterator - Skip and move to next branch?

[Michael Z. <li...@in...>]

Hi there!

for a project I use jgrapht as library to store information about
parent-child relationships. Thanks a lot for this great library!

One issue I could not solve myself is related to DepthFirstIteration.

Assume the following graph:
A->B->C-D->E
A->X->Y->Z

I want to iterate over all items in my graph depth first. If a certain
condition is true, the rest of the current branch should be skipped and
the iterator should continue with the next branch.

In my example, the iterator would go as follows:
1) A->X->Y (condition fulfilled; skip Z)
2) B->C->D->E

Is there an easy way how to solve this? Any option like:

DepthFirstIterator it = new ...
while (it.hasNext()) {
  MyObject o = it.next();
  if (o.condition == true)
     it.nextBranch()


thanks and cu, Michael

[jgrapht-users] about betweenness

[zhaojichang_nlsde <zha...@nl...>]

can I use the lib of JgraphT to compute some graph's betweenness?

Re: [jgrapht-users] jgrapht layout algorithm?

[John V. S. <js...@gm...>]

The layout algorithms in the JGraph addons package worked in the past; 
I'm not sure about the current state since JGraph commercialized it.

Looks like there's an O'Reilly book based on an old version of JGraphT:

http://safari.oreilly.com/1593270615/ns1593270615-CHP-6-SECT-4

JVS

hu...@gm... wrote:
> hi,
> 
> Im using your graph library which is great but is there any layout
> generator included?
> 
> Because it seems when I create my graph with addVertex and addEdge,
> all the nodes appear on top of each other.
> 
> Of course I could position them manually by modifying the vertex's
> attributes, but that would require crazy amount of work for huge graph
> of let say 25+ nodes.
> 
> So is there any layout generators (like yfiles from yworks) included
> or do you know any that's easily includable?
> 
> Thanks
>