jgrapht-users — JGraphT user list.

Re: [jgrapht-users] JGraph documentation?

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

That is correct.  With the last released version on sourceforge, if you
unpack it and run

java -jar jgrapht-jdk1.6.jar

you should see the visualization pop up in a window.

I'm not sure about the latest state on github since one of the blockers for
the next release is to make sure that we still have packaging equivalent to
the last release, and there were many changes as part of moving to mvn for
the build.

There's also an open pull request for JGraphX:

https://github.com/jgrapht/jgrapht/pull/39

If someone wants to take a first pass on reviewing that, we can work
together on getting it committed.

JVS



On Mon, Oct 14, 2013 at 11:19 AM, Daniels, Troy (US SSA) <
tro...@ba...> wrote:

>  I was looking at JGraphAdapterDemo in org.jgrapht.demo.  It creates a
> JGraphT object and then displays it via JGraph.  The front page at
> http://jgrapht.org/ also says:****
>
> ** **
>
> ** **
>
> Other features offered by JGraphT:****
>
> **·             **graph visualization using the JGraph library (try this
> demo! <http://jgrapht.org/visualizations.html>)****
>
> ** **
>
> So it seemed that JGraphT and JGraph were the default coupling for working
> with and displaying a graph.  Is that not correct?
>
> Troy****
>
> ** **
>
> *From:* Joris Kinable [mailto:de...@gm...]
> *Sent:* Friday, October 11, 2013 12:00 AM
> *To:* Daniels, Troy (US SSA)
> *Cc:* jgr...@li...
> *Subject:* Re: [jgrapht-users] JGraph documentation?****
>
> ** **
>
> Hi Troy,****
>
> ** **
>
> I'm not sure whether I understand your question entirely correct. JgraphT
> is a package which mainly focusses on graph algorithms. It contains some
> basic graph visualization support. See for an example:
> http://jgrapht.org/visualizations.html****
>
> JgraphX is a different library. Its main focus is on graph visualization.
> See for example the 'Hello world' example of jgraphx:
> https://github.com/jgraph/jgraphx/blob/master/examples/com/mxgraph/examples/swing/HelloWorld.java
> ****
>
> ** **
>
> You can choose which package you want to use for the visualization. I
> personally prefer to use JgraphT for the algorithms, and to use JgraphX for
> the visualization. An added benefit for JgraphX is the support for a number
> of listeners and layout managers.****
>
> ** **
>
> br,****
>
> ** **
>
> Joris****
>
> ** **
>
> On Thu, Oct 10, 2013 at 6:33 PM, Daniels, Troy (US SSA) <
> tro...@ba...> wrote:****
>
> Hello,****
>
>  ****
>
> I am trying to use JGraphT and JGraph to display some graphs.  I found
> jgraph.jar in the jgrapht distribution, but I am having trouble finding
> information about jgraph on the web.  http://jgraph.org appears to have
> two products: mxGraph and JGraphX, neither of which corresponds to the jar
> in the JgraphT distribution.  ****
>
>  ****
>
> Is this somewhere obvious, or did JGraph move on to a new format and
> JGraphT is associated with an abandoned project?  If there is another way
> to visualize the graphs, I am happy to move to that, but I don’t see any
> other adapters in the documentation.****
>
>  ****
>
> Troy****
>
>
>
> ------------------------------------------------------------------------------
> October Webinars: Code for Performance
> Free Intel webinars can help you accelerate application performance.
> Explore tips for MPI, OpenMP, advanced profiling, and more. Get the most
> from
> the latest Intel processors and coprocessors. See abstracts and register >
> http://pubads.g.doubleclick.net/gampad/clk?id=60134071&iu=/4140/ostg.clktrk
> _______________________________________________
> jgrapht-users mailing list
> jgr...@li...
> https://lists.sourceforge.net/lists/listinfo/jgrapht-users****
>
> ** **
>
>
> ------------------------------------------------------------------------------
> October Webinars: Code for Performance
> Free Intel webinars can help you accelerate application performance.
> Explore tips for MPI, OpenMP, advanced profiling, and more. Get the most
> from
> the latest Intel processors and coprocessors. See abstracts and register >
> http://pubads.g.doubleclick.net/gampad/clk?id=60134071&iu=/4140/ostg.clktrk
> _______________________________________________
> jgrapht-users mailing list
> jgr...@li...
> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
>
>

Re: [jgrapht-users] JGraph documentation?

[Daniels, T. (US SSA) <tro...@ba...>]

I was looking at JGraphAdapterDemo in org.jgrapht.demo.  It creates a JGraphT object and then displays it via JGraph.  The front page at http://jgrapht.org/ also says:


Other features offered by JGraphT:
*             graph visualization using the JGraph library (try this demo!<http://jgrapht.org/visualizations.html>)

So it seemed that JGraphT and JGraph were the default coupling for working with and displaying a graph.  Is that not correct?

Troy

From: Joris Kinable [mailto:de...@gm...]
Sent: Friday, October 11, 2013 12:00 AM
To: Daniels, Troy (US SSA)
Cc: jgr...@li...
Subject: Re: [jgrapht-users] JGraph documentation?

Hi Troy,

I'm not sure whether I understand your question entirely correct. JgraphT is a package which mainly focusses on graph algorithms. It contains some basic graph visualization support. See for an example: http://jgrapht.org/visualizations.html
JgraphX is a different library. Its main focus is on graph visualization. See for example the 'Hello world' example of jgraphx: https://github.com/jgraph/jgraphx/blob/master/examples/com/mxgraph/examples/swing/HelloWorld.java

You can choose which package you want to use for the visualization. I personally prefer to use JgraphT for the algorithms, and to use JgraphX for the visualization. An added benefit for JgraphX is the support for a number of listeners and layout managers.

br,

Joris

On Thu, Oct 10, 2013 at 6:33 PM, Daniels, Troy (US SSA) <tro...@ba...<mailto:tro...@ba...>> wrote:
Hello,

I am trying to use JGraphT and JGraph to display some graphs.  I found jgraph.jar in the jgrapht distribution, but I am having trouble finding information about jgraph on the web.  http://jgraph.org appears to have two products: mxGraph and JGraphX, neither of which corresponds to the jar in the JgraphT distribution.

Is this somewhere obvious, or did JGraph move on to a new format and JGraphT is associated with an abandoned project?  If there is another way to visualize the graphs, I am happy to move to that, but I don't see any other adapters in the documentation.

Troy

------------------------------------------------------------------------------
October Webinars: Code for Performance
Free Intel webinars can help you accelerate application performance.
Explore tips for MPI, OpenMP, advanced profiling, and more. Get the most from
the latest Intel processors and coprocessors. See abstracts and register >
http://pubads.g.doubleclick.net/gampad/clk?id=60134071&iu=/4140/ostg.clktrk
_______________________________________________
jgrapht-users mailing list
jgr...@li...<mailto:jgr...@li...>
https://lists.sourceforge.net/lists/listinfo/jgrapht-users

Re: [jgrapht-users] JGraph documentation?

[Sebastian M. <woo...@gm...>]

Hi Troy,

I wonder if the jgraph.jar is only there to enable saving your JGraphT 
graph in JGraph(X) format. I don't think it's possible to visualize your 
graph directly from JGraphT, but you can certainly use the 
JGraphModelAdapter to save your graph and then open it with JGraphX.

Other than that, I recommend JUNG: http://jung.sourceforge.net/. It's 
not as polished as JGraphX, but powerful nonetheless. Save your graph in 
.dot format and load it into your JUNG program. I have some code 
snippets for that at work, if you need help with that.


Sebastian


Am 11.10.2013 00:33, schrieb Daniels, Troy (US SSA):
>
> Hello,
>
> I am trying to use JGraphT and JGraph to display some graphs.  I found 
> jgraph.jar in the jgrapht distribution, but I am having trouble 
> finding information about jgraph on the web. http://jgraph.org appears 
> to have two products: mxGraph and JGraphX, neither of which 
> corresponds to the jar in the JgraphT distribution.
>
> Is this somewhere obvious, or did JGraph move on to a new format and 
> JGraphT is associated with an abandoned project?  If there is another 
> way to visualize the graphs, I am happy to move to that, but I don't 
> see any other adapters in the documentation.
>
> Troy
>
>
>
> ------------------------------------------------------------------------------
> October Webinars: Code for Performance
> Free Intel webinars can help you accelerate application performance.
> Explore tips for MPI, OpenMP, advanced profiling, and more. Get the most from
> the latest Intel processors and coprocessors. See abstracts and register >
> http://pubads.g.doubleclick.net/gampad/clk?id=60134071&iu=/4140/ostg.clktrk
>
>
> _______________________________________________
> jgrapht-users mailing list
> jgr...@li...
> https://lists.sourceforge.net/lists/listinfo/jgrapht-users

Re: [jgrapht-users] JGraph documentation?

[Joris K. <de...@gm...>]

Hi Troy,

I'm not sure whether I understand your question entirely correct. JgraphT
is a package which mainly focusses on graph algorithms. It contains some
basic graph visualization support. See for an example:
http://jgrapht.org/visualizations.html
JgraphX is a different library. Its main focus is on graph visualization.
See for example the 'Hello world' example of jgraphx:
https://github.com/jgraph/jgraphx/blob/master/examples/com/mxgraph/examples/swing/HelloWorld.java

You can choose which package you want to use for the visualization. I
personally prefer to use JgraphT for the algorithms, and to use JgraphX for
the visualization. An added benefit for JgraphX is the support for a number
of listeners and layout managers.

br,

Joris


On Thu, Oct 10, 2013 at 6:33 PM, Daniels, Troy (US SSA) <
tro...@ba...> wrote:

>  Hello,****
>
> ** **
>
> I am trying to use JGraphT and JGraph to display some graphs.  I found
> jgraph.jar in the jgrapht distribution, but I am having trouble finding
> information about jgraph on the web.  http://jgraph.org appears to have
> two products: mxGraph and JGraphX, neither of which corresponds to the jar
> in the JgraphT distribution.  ****
>
> ** **
>
> Is this somewhere obvious, or did JGraph move on to a new format and
> JGraphT is associated with an abandoned project?  If there is another way
> to visualize the graphs, I am happy to move to that, but I don’t see any
> other adapters in the documentation.****
>
> ** **
>
> Troy****
>
>
> ------------------------------------------------------------------------------
> October Webinars: Code for Performance
> Free Intel webinars can help you accelerate application performance.
> Explore tips for MPI, OpenMP, advanced profiling, and more. Get the most
> from
> the latest Intel processors and coprocessors. See abstracts and register >
> http://pubads.g.doubleclick.net/gampad/clk?id=60134071&iu=/4140/ostg.clktrk
> _______________________________________________
> jgrapht-users mailing list
> jgr...@li...
> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
>
>

[jgrapht-users] JGraph documentation?

[Daniels, T. (US SSA) <tro...@ba...>]

Hello,

I am trying to use JGraphT and JGraph to display some graphs.  I found jgraph.jar in the jgrapht distribution, but I am having trouble finding information about jgraph on the web.  http://jgraph.org appears to have two products: mxGraph and JGraphX, neither of which corresponds to the jar in the JgraphT distribution.

Is this somewhere obvious, or did JGraph move on to a new format and JGraphT is associated with an abandoned project?  If there is another way to visualize the graphs, I am happy to move to that, but I don't see any other adapters in the documentation.

Troy

Re: [jgrapht-users] Maven and Version

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

Everyone seems to want this but no one seems to have time or skills
required to make the necessary contribution.

http://jgrapht-users.107614.n3.nabble.com/Please-upload-latest-to-maven-repo-td4024840.html


On Tue, Oct 1, 2013 at 3:39 AM, Nuno Oliveira <
nun...@pt...> wrote:

>  Hi,
>
> I have some questions about the versioning of JGraphT.
>
> The current root pom.xml defines the 0.8.3-SNAPSHOT version. Since the
> version 0.8.4 is
> under development shouldn't the root pom.xml define the 0.8.4-SNAPSHOT
> version ?
>
> Is in our plans to make JGraphT snapshots available on maven central ?
>
> When will be the next release ?
>
> Thanks.
>
> Best regards,
>
> Nuno Oliveira
>
>
>
>
>
> ------------------------------------------------------------------------------
> October Webinars: Code for Performance
> Free Intel webinars can help you accelerate application performance.
> Explore tips for MPI, OpenMP, advanced profiling, and more. Get the most
> from
> the latest Intel processors and coprocessors. See abstracts and register >
> http://pubads.g.doubleclick.net/gampad/clk?id=60134791&iu=/4140/ostg.clktrk
> _______________________________________________
> jgrapht-users mailing list
> jgr...@li...
> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
>
>

Re: [jgrapht-users] minimum cut in a directed graph

[Joris K. <de...@gm...>]

Hi,

Thanks for all the replies.

@Ahmed: I think you missed my point. You are talking about the standard max
flow min cut algorithm for a given s and t. I was asking for an algorithm
which computes the global min cut, i.e. the min cut for *all* (s,t) pairs
in the graph. Using the standard Ford Fulkerson algorithm is way to slow to
do that. FYI:  last year I implemented this algorithm, and shared it with
the Jgrapht community (see my implementation: MinSourceSinkCut) :). For
this I used the Edmonds-Karp implementation.

@Luc: Thanks for the suggestion. For this project I prefer however a
solution which does not require a solver.

I think I found the solution. Hao and Orlin, A Faster Algorithm for Finding
the Minimum Cut in a Directed Graph (1994) have proposed an efficient
solution for my problem. Implementation details can be found in:
Cherkassky, Goldberg, On Implementing push-relabel method for the maximum
flow problem (1994). Although I couldn't find any Java implementations, a C
implementation can be found here:
http://www.zib.de/en/services/web-services/mathprog/mincut.html
see: global-dir.tar.Z
It is easy to modify the code and if gives exactly what I need: a
partitioning of the nodes in S and T, and the cut weight.
If I find some time in the future, I might consider implementing this in
jgrapht as well.

Thanks for the suggestions,

Joris


On Tue, Oct 1, 2013 at 3:44 PM, Ahmed Abdeen Hamed
<ahm...@gm...>wrote:

> Hello Joris,
>
> The Min Cut is indeed a also a Max Flow problem. For this you can use the
> Ford Fulkerson algorithm. Here are some slides that you might need to read
> before you actually do the implementation:
> http://www.cs.princeton.edu/courses/archive/spr04/cos226/lectures/maxflow.4up.pdf
>
> I don't know if jgraph has it but it might because it is one of the
> fundamental algorithms in Network  Flow. I would respectfully advise that
> you understand the theory very well before you do the coding. When you do,
> you might find yourself designing a very neat algorithm and make a
> discovery. Hopefully you will be generous it with the rest of us ;)
>
> Good luck!
>
> -Ahmed
>
>
>
>
> On Tue, Oct 1, 2013 at 3:18 PM, Joris Kinable <de...@gm...> wrote:
>
>> Hi,
>>
>> I'm looking for an algorithm which computes the Minimum cut in a
>> *directed*, weighted graph. All weights are positive, and the graph does
>> not contain self loops. In the jgrapht package, there exists a Stoer Wagner
>> implementation which computes the minimum cut in an undirected graph. I
>> need the equivalent for a directed graph.
>> Jgrapht contains an algorithm for computing the minimum s-t cut in a
>> directed graph, but this would require me to invoke the algorithm for every
>> s-t pair, which is way to expensive. Any suggestion is welcome:
>>
>> 1. Do you know an algorithm/paper/book which describes such an algorithm.
>> 2. Do you know a implementation of such an algorithm, preferably in java.
>>
>> Say for example that you have two vertices, a and b, and two arcs: (a,b)
>> with capacity 4 and (b,a) with capacity 2. Then the minimum cut would be to
>> partition the vertices into two sets, S and T, such that the max flow from
>> S to T equals the minimum cut. For this example, the solution would be:
>> S={b}, T={a}, max flow: 2.
>>
>>
>> br,
>>
>> Joris
>>
>>
>> ------------------------------------------------------------------------------
>> October Webinars: Code for Performance
>> Free Intel webinars can help you accelerate application performance.
>> Explore tips for MPI, OpenMP, advanced profiling, and more. Get the most
>> from
>> the latest Intel processors and coprocessors. See abstracts and register >
>>
>> http://pubads.g.doubleclick.net/gampad/clk?id=60134791&iu=/4140/ostg.clktrk
>> _______________________________________________
>> jgrapht-users mailing list
>> jgr...@li...
>> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
>>
>>
>

Re: [jgrapht-users] minimum cut in a directed graph

[Ahmed A. H. <ahm...@gm...>]

Hello Joris,

The Min Cut is indeed a also a Max Flow problem. For this you can use the
Ford Fulkerson algorithm. Here are some slides that you might need to read
before you actually do the implementation:
http://www.cs.princeton.edu/courses/archive/spr04/cos226/lectures/maxflow.4up.pdf

I don't know if jgraph has it but it might because it is one of the
fundamental algorithms in Network  Flow. I would respectfully advise that
you understand the theory very well before you do the coding. When you do,
you might find yourself designing a very neat algorithm and make a
discovery. Hopefully you will be generous it with the rest of us ;)

Good luck!

-Ahmed




On Tue, Oct 1, 2013 at 3:18 PM, Joris Kinable <de...@gm...> wrote:

> Hi,
>
> I'm looking for an algorithm which computes the Minimum cut in a
> *directed*, weighted graph. All weights are positive, and the graph does
> not contain self loops. In the jgrapht package, there exists a Stoer Wagner
> implementation which computes the minimum cut in an undirected graph. I
> need the equivalent for a directed graph.
> Jgrapht contains an algorithm for computing the minimum s-t cut in a
> directed graph, but this would require me to invoke the algorithm for every
> s-t pair, which is way to expensive. Any suggestion is welcome:
>
> 1. Do you know an algorithm/paper/book which describes such an algorithm.
> 2. Do you know a implementation of such an algorithm, preferably in java.
>
> Say for example that you have two vertices, a and b, and two arcs: (a,b)
> with capacity 4 and (b,a) with capacity 2. Then the minimum cut would be to
> partition the vertices into two sets, S and T, such that the max flow from
> S to T equals the minimum cut. For this example, the solution would be:
> S={b}, T={a}, max flow: 2.
>
>
> br,
>
> Joris
>
>
> ------------------------------------------------------------------------------
> October Webinars: Code for Performance
> Free Intel webinars can help you accelerate application performance.
> Explore tips for MPI, OpenMP, advanced profiling, and more. Get the most
> from
> the latest Intel processors and coprocessors. See abstracts and register >
> http://pubads.g.doubleclick.net/gampad/clk?id=60134791&iu=/4140/ostg.clktrk
> _______________________________________________
> jgrapht-users mailing list
> jgr...@li...
> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
>
>

[jgrapht-users] minimum cut in a directed graph

[Joris K. <de...@gm...>]

Hi,

I'm looking for an algorithm which computes the Minimum cut in a
*directed*, weighted graph. All weights are positive, and the graph does
not contain self loops. In the jgrapht package, there exists a Stoer Wagner
implementation which computes the minimum cut in an undirected graph. I
need the equivalent for a directed graph.
Jgrapht contains an algorithm for computing the minimum s-t cut in a
directed graph, but this would require me to invoke the algorithm for every
s-t pair, which is way to expensive. Any suggestion is welcome:

1. Do you know an algorithm/paper/book which describes such an algorithm.
2. Do you know a implementation of such an algorithm, preferably in java.

Say for example that you have two vertices, a and b, and two arcs: (a,b)
with capacity 4 and (b,a) with capacity 2. Then the minimum cut would be to
partition the vertices into two sets, S and T, such that the max flow from
S to T equals the minimum cut. For this example, the solution would be:
S={b}, T={a}, max flow: 2.


br,

Joris

[jgrapht-users] Maven and Version

[Nuno O. <nun...@pt...>]

Hi,

I have some questions about the versioning of JGraphT.

The current root pom.xml defines the 0.8.3-SNAPSHOT version. Since the 
version 0.8.4 is
under development shouldn't the root pom.xml define the 0.8.4-SNAPSHOT 
version ?

Is in our plans to make JGraphT snapshots available on maven central ?

When will be the next release ?

Thanks.

Best regards,

Nuno Oliveira

Re: [jgrapht-users] Non-cyclical Hamiltonian?

[Joris K. <de...@gm...>]

What you could do is the following:

Take your graph and add an extra artificial node Z which has edges to every
other node. Lets say you are trying to find your hamiltonian path starting
from a vertex X. Lets assume there is such a path in the original graph
which starts at X and ends in node Y. In the new graph, you would have a
hamiltonian cycle: [X, ... , Y, Z, X]. Your hamiltonian path can be
recovered by removing node Z from the cycle. Consequently, you can use the
original HamiltonianCycle class in JGraphT on the graph extended by the
artificial node.

Just a small remark: As noted by Chris, the HC problem is NP-hard. The
HamiltonianCycle class works on small instances, but is by no means
optimized for large instances. If you want to solve large instances, have a
look at dedicated solvers such as the Concorde TSP solver.

br,

Joris


On Sun, Sep 29, 2013 at 1:35 AM, Darrell Esau <de...@so...> wrote:

> Sure -- but there is a HamiltonianCycle class in JGraphT which can give an
> approximate optimal tour.  It seems like (to the untrained eye), it's a
> small step to take that and remove the cyclical requirement (thus making it
> just a hamiltonian path), and being able to specify a start node.
>
>
>
>
> On Sat, Sep 28, 2013 at 10:21 PM, Chris Esposito <chr...@gm...
> > wrote:
>
>> Determining the existence of Hamiltonian paths in graphs is NP-Complete,
>> so if the graph is not small the only advice I'd offer is "have patience"
>> :-)
>>
>> Sent from my iPad
>>
>> On Sep 28, 2013, at 10:13 PM, Darrell Esau <de...@so...> wrote:
>>
>> > Hi all,
>> >
>> > Is there a way to get a hamiltonian cycle for a given node, but not
>> actually a cycle?
>> >
>> > Given a graph and a starting node, I'd like to find a path that will
>> cover each node exactly once, but not returning to the origin.
>> >
>> > Any advice?
>> >
>> > Thanks!
>> > -darrell
>> >
>> ------------------------------------------------------------------------------
>> > October Webinars: Code for Performance
>> > Free Intel webinars can help you accelerate application performance.
>> > Explore tips for MPI, OpenMP, advanced profiling, and more. Get the
>> most from
>> > the latest Intel processors and coprocessors. See abstracts and
>> register >
>> >
>> http://pubads.g.doubleclick.net/gampad/clk?id=60133471&iu=/4140/ostg.clktrk
>> > _______________________________________________
>> > jgrapht-users mailing list
>> > jgr...@li...
>> > https://lists.sourceforge.net/lists/listinfo/jgrapht-users
>>
>
>
>
> ------------------------------------------------------------------------------
> October Webinars: Code for Performance
> Free Intel webinars can help you accelerate application performance.
> Explore tips for MPI, OpenMP, advanced profiling, and more. Get the most
> from
> the latest Intel processors and coprocessors. See abstracts and register >
> http://pubads.g.doubleclick.net/gampad/clk?id=60133471&iu=/4140/ostg.clktrk
> _______________________________________________
> jgrapht-users mailing list
> jgr...@li...
> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
>
>

Re: [jgrapht-users] Non-cyclical Hamiltonian?

[Darrell E. <de...@so...>]

Sure -- but there is a HamiltonianCycle class in JGraphT which can give an
approximate optimal tour.  It seems like (to the untrained eye), it's a
small step to take that and remove the cyclical requirement (thus making it
just a hamiltonian path), and being able to specify a start node.




On Sat, Sep 28, 2013 at 10:21 PM, Chris Esposito
<chr...@gm...>wrote:

> Determining the existence of Hamiltonian paths in graphs is NP-Complete,
> so if the graph is not small the only advice I'd offer is "have patience"
> :-)
>
> Sent from my iPad
>
> On Sep 28, 2013, at 10:13 PM, Darrell Esau <de...@so...> wrote:
>
> > Hi all,
> >
> > Is there a way to get a hamiltonian cycle for a given node, but not
> actually a cycle?
> >
> > Given a graph and a starting node, I'd like to find a path that will
> cover each node exactly once, but not returning to the origin.
> >
> > Any advice?
> >
> > Thanks!
> > -darrell
> >
> ------------------------------------------------------------------------------
> > October Webinars: Code for Performance
> > Free Intel webinars can help you accelerate application performance.
> > Explore tips for MPI, OpenMP, advanced profiling, and more. Get the most
> from
> > the latest Intel processors and coprocessors. See abstracts and register
> >
> >
> http://pubads.g.doubleclick.net/gampad/clk?id=60133471&iu=/4140/ostg.clktrk
> > _______________________________________________
> > jgrapht-users mailing list
> > jgr...@li...
> > https://lists.sourceforge.net/lists/listinfo/jgrapht-users
>

Re: [jgrapht-users] Non-cyclical Hamiltonian?

[Chris E. <chr...@gm...>]

Determining the existence of Hamiltonian paths in graphs is NP-Complete, so if the graph is not small the only advice I'd offer is "have patience" :-)

Sent from my iPad

On Sep 28, 2013, at 10:13 PM, Darrell Esau <de...@so...> wrote:

> Hi all,
> 
> Is there a way to get a hamiltonian cycle for a given node, but not actually a cycle?
> 
> Given a graph and a starting node, I'd like to find a path that will cover each node exactly once, but not returning to the origin.
> 
> Any advice?
> 
> Thanks!
> -darrell
> ------------------------------------------------------------------------------
> October Webinars: Code for Performance
> Free Intel webinars can help you accelerate application performance.
> Explore tips for MPI, OpenMP, advanced profiling, and more. Get the most from 
> the latest Intel processors and coprocessors. See abstracts and register >
> http://pubads.g.doubleclick.net/gampad/clk?id=60133471&iu=/4140/ostg.clktrk
> _______________________________________________
> jgrapht-users mailing list
> jgr...@li...
> https://lists.sourceforge.net/lists/listinfo/jgrapht-users

[jgrapht-users] Non-cyclical Hamiltonian?

[Darrell E. <de...@so...>]

Hi all,

Is there a way to get a hamiltonian cycle for a given node, but not
actually a cycle?

Given a graph and a starting node, I'd like to find a path that will cover
each node exactly once, but not returning to the origin.

Any advice?

Thanks!
-darrell

Re: [jgrapht-users] Please upload latest to maven repo

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

No, the source should be from the current build, which would then be
published as a SNAPSHOT release.  If we had a nightly build process (e.g.
with Jenkins), it should come from there, but we don't currently.


On Mon, Sep 16, 2013 at 10:09 PM, Venkat K <ven...@go...>wrote:

> Hi John,
>
> Thanks for the explanation. I must admit that I am new to Maven and GIT.
> So, as part of this, we should upload the latest jar in the sourceforge
> http://sourceforge.net/projects/jgrapht/?source=directory to maven
> central repo?
>
> Thanks,
>
> Venkat
>
>
> On Mon, Sep 16, 2013 at 8:00 PM, John Sichi <js...@gm...> wrote:
>
>> It entails following the instructions such as the ones below, submitting
>> pull requests to me for any necessary build changes.  Once everything is
>> tested out and working smoothly, we can make it an official part of the
>> JGraphT release process.
>>
>>
>> http://datumedge.blogspot.de/2012/05/publishing-from-github-to-maven-central.html
>>
>>
>> On Mon, Sep 16, 2013 at 12:50 PM, Venkat K <ven...@go...>wrote:
>>
>>> Thanks John for the reply. Please let me know what does this
>>> responsibility entail.
>>>
>>>
>>> On Sat, Sep 14, 2013 at 1:35 PM, John Sichi <js...@gm...> wrote:
>>>
>>>> Hi Venkat,
>>>>
>>>> So far, all maven uploads have been guerrilla operations by people
>>>> unassociated with JGraphT.  We would love to have someone volunteer to do
>>>> this in an official capacity as part of our release management; let me know
>>>> if you're available to take this on.
>>>>
>>>> https://github.com/jgrapht/jgrapht/wiki/AdoptAHighway
>>>>
>>>> JVS
>>>>
>>>>
>>>>
>>>> On Thu, Sep 12, 2013 at 12:52 PM, Venkat K <ven...@go...>wrote:
>>>>
>>>>> Hi JGraphT Team,
>>>>>
>>>>> I looked at the javadocs for JGraphT and I really liked it. However, I
>>>>> do not see the latest versions uploaded in maven. The last I upload I see
>>>>> is for version 0.7.3. Can you please upload the latest stable version to
>>>>> both these places.
>>>>>
>>>>> http://mvnrepository.com/artifact/jgrapht/jgrapht
>>>>> http://search.maven.org/#search%7Cga%7C1%7Cjgrapht
>>>>>
>>>>> Thanks,
>>>>>
>>>>> Venkat
>>>>>
>>>>>
>>>>> ------------------------------------------------------------------------------
>>>>> LIMITED TIME SALE - Full Year of Microsoft Training For Just $49.99!
>>>>> 1,500+ hours of tutorials including VisualStudio 2012, Windows 8,
>>>>> SharePoint
>>>>> 2013, SQL 2012, MVC 4, more. BEST VALUE: New Multi-Library Power Pack
>>>>> includes
>>>>> Mobile, Cloud, Java, and UX Design. Lowest price ever! Ends 9/22/13.
>>>>>
>>>>> http://pubads.g.doubleclick.net/gampad/clk?id=64545871&iu=/4140/ostg.clktrk
>>>>> _______________________________________________
>>>>> jgrapht-users mailing list
>>>>> jgr...@li...
>>>>> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
>>>>>
>>>>>
>>>>
>>>
>>
>

Re: [jgrapht-users] Please upload latest to maven repo

[Venkat K <ven...@go...>]

Hi John,

Thanks for the explanation. I must admit that I am new to Maven and GIT.
So, as part of this, we should upload the latest jar in the sourceforge
http://sourceforge.net/projects/jgrapht/?source=directory to maven central
repo?

Thanks,

Venkat


On Mon, Sep 16, 2013 at 8:00 PM, John Sichi <js...@gm...> wrote:

> It entails following the instructions such as the ones below, submitting
> pull requests to me for any necessary build changes.  Once everything is
> tested out and working smoothly, we can make it an official part of the
> JGraphT release process.
>
>
> http://datumedge.blogspot.de/2012/05/publishing-from-github-to-maven-central.html
>
>
> On Mon, Sep 16, 2013 at 12:50 PM, Venkat K <ven...@go...>wrote:
>
>> Thanks John for the reply. Please let me know what does this
>> responsibility entail.
>>
>>
>> On Sat, Sep 14, 2013 at 1:35 PM, John Sichi <js...@gm...> wrote:
>>
>>> Hi Venkat,
>>>
>>> So far, all maven uploads have been guerrilla operations by people
>>> unassociated with JGraphT.  We would love to have someone volunteer to do
>>> this in an official capacity as part of our release management; let me know
>>> if you're available to take this on.
>>>
>>> https://github.com/jgrapht/jgrapht/wiki/AdoptAHighway
>>>
>>> JVS
>>>
>>>
>>>
>>> On Thu, Sep 12, 2013 at 12:52 PM, Venkat K <ven...@go...>wrote:
>>>
>>>> Hi JGraphT Team,
>>>>
>>>> I looked at the javadocs for JGraphT and I really liked it. However, I
>>>> do not see the latest versions uploaded in maven. The last I upload I see
>>>> is for version 0.7.3. Can you please upload the latest stable version to
>>>> both these places.
>>>>
>>>> http://mvnrepository.com/artifact/jgrapht/jgrapht
>>>> http://search.maven.org/#search%7Cga%7C1%7Cjgrapht
>>>>
>>>> Thanks,
>>>>
>>>> Venkat
>>>>
>>>>
>>>> ------------------------------------------------------------------------------
>>>> LIMITED TIME SALE - Full Year of Microsoft Training For Just $49.99!
>>>> 1,500+ hours of tutorials including VisualStudio 2012, Windows 8,
>>>> SharePoint
>>>> 2013, SQL 2012, MVC 4, more. BEST VALUE: New Multi-Library Power Pack
>>>> includes
>>>> Mobile, Cloud, Java, and UX Design. Lowest price ever! Ends 9/22/13.
>>>>
>>>> http://pubads.g.doubleclick.net/gampad/clk?id=64545871&iu=/4140/ostg.clktrk
>>>> _______________________________________________
>>>> jgrapht-users mailing list
>>>> jgr...@li...
>>>> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
>>>>
>>>>
>>>
>>
>

Re: [jgrapht-users] Please upload latest to maven repo

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

It entails following the instructions such as the ones below, submitting
pull requests to me for any necessary build changes.  Once everything is
tested out and working smoothly, we can make it an official part of the
JGraphT release process.

http://datumedge.blogspot.de/2012/05/publishing-from-github-to-maven-central.html


On Mon, Sep 16, 2013 at 12:50 PM, Venkat K <ven...@go...>wrote:

> Thanks John for the reply. Please let me know what does this
> responsibility entail.
>
>
> On Sat, Sep 14, 2013 at 1:35 PM, John Sichi <js...@gm...> wrote:
>
>> Hi Venkat,
>>
>> So far, all maven uploads have been guerrilla operations by people
>> unassociated with JGraphT.  We would love to have someone volunteer to do
>> this in an official capacity as part of our release management; let me know
>> if you're available to take this on.
>>
>> https://github.com/jgrapht/jgrapht/wiki/AdoptAHighway
>>
>> JVS
>>
>>
>>
>> On Thu, Sep 12, 2013 at 12:52 PM, Venkat K <ven...@go...>wrote:
>>
>>> Hi JGraphT Team,
>>>
>>> I looked at the javadocs for JGraphT and I really liked it. However, I
>>> do not see the latest versions uploaded in maven. The last I upload I see
>>> is for version 0.7.3. Can you please upload the latest stable version to
>>> both these places.
>>>
>>> http://mvnrepository.com/artifact/jgrapht/jgrapht
>>> http://search.maven.org/#search%7Cga%7C1%7Cjgrapht
>>>
>>> Thanks,
>>>
>>> Venkat
>>>
>>>
>>> ------------------------------------------------------------------------------
>>> LIMITED TIME SALE - Full Year of Microsoft Training For Just $49.99!
>>> 1,500+ hours of tutorials including VisualStudio 2012, Windows 8,
>>> SharePoint
>>> 2013, SQL 2012, MVC 4, more. BEST VALUE: New Multi-Library Power Pack
>>> includes
>>> Mobile, Cloud, Java, and UX Design. Lowest price ever! Ends 9/22/13.
>>>
>>> http://pubads.g.doubleclick.net/gampad/clk?id=64545871&iu=/4140/ostg.clktrk
>>> _______________________________________________
>>> jgrapht-users mailing list
>>> jgr...@li...
>>> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
>>>
>>>
>>
>

Re: [jgrapht-users] Please upload latest to maven repo

[Venkat K <ven...@go...>]

Thanks John for the reply. Please let me know what does this responsibility
entail.


On Sat, Sep 14, 2013 at 1:35 PM, John Sichi <js...@gm...> wrote:

> Hi Venkat,
>
> So far, all maven uploads have been guerrilla operations by people
> unassociated with JGraphT.  We would love to have someone volunteer to do
> this in an official capacity as part of our release management; let me know
> if you're available to take this on.
>
> https://github.com/jgrapht/jgrapht/wiki/AdoptAHighway
>
> JVS
>
>
>
> On Thu, Sep 12, 2013 at 12:52 PM, Venkat K <ven...@go...>wrote:
>
>> Hi JGraphT Team,
>>
>> I looked at the javadocs for JGraphT and I really liked it. However, I do
>> not see the latest versions uploaded in maven. The last I upload I see is
>> for version 0.7.3. Can you please upload the latest stable version to both
>> these places.
>>
>> http://mvnrepository.com/artifact/jgrapht/jgrapht
>> http://search.maven.org/#search%7Cga%7C1%7Cjgrapht
>>
>> Thanks,
>>
>> Venkat
>>
>>
>> ------------------------------------------------------------------------------
>> LIMITED TIME SALE - Full Year of Microsoft Training For Just $49.99!
>> 1,500+ hours of tutorials including VisualStudio 2012, Windows 8,
>> SharePoint
>> 2013, SQL 2012, MVC 4, more. BEST VALUE: New Multi-Library Power Pack
>> includes
>> Mobile, Cloud, Java, and UX Design. Lowest price ever! Ends 9/22/13.
>>
>> http://pubads.g.doubleclick.net/gampad/clk?id=64545871&iu=/4140/ostg.clktrk
>> _______________________________________________
>> jgrapht-users mailing list
>> jgr...@li...
>> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
>>
>>
>

Re: [jgrapht-users] Please upload latest to maven repo

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

Hi Venkat,

So far, all maven uploads have been guerrilla operations by people
unassociated with JGraphT.  We would love to have someone volunteer to do
this in an official capacity as part of our release management; let me know
if you're available to take this on.

https://github.com/jgrapht/jgrapht/wiki/AdoptAHighway

JVS



On Thu, Sep 12, 2013 at 12:52 PM, Venkat K <ven...@go...>wrote:

> Hi JGraphT Team,
>
> I looked at the javadocs for JGraphT and I really liked it. However, I do
> not see the latest versions uploaded in maven. The last I upload I see is
> for version 0.7.3. Can you please upload the latest stable version to both
> these places.
>
> http://mvnrepository.com/artifact/jgrapht/jgrapht
> http://search.maven.org/#search%7Cga%7C1%7Cjgrapht
>
> Thanks,
>
> Venkat
>
>
> ------------------------------------------------------------------------------
> LIMITED TIME SALE - Full Year of Microsoft Training For Just $49.99!
> 1,500+ hours of tutorials including VisualStudio 2012, Windows 8,
> SharePoint
> 2013, SQL 2012, MVC 4, more. BEST VALUE: New Multi-Library Power Pack
> includes
> Mobile, Cloud, Java, and UX Design. Lowest price ever! Ends 9/22/13.
> http://pubads.g.doubleclick.net/gampad/clk?id=64545871&iu=/4140/ostg.clktrk
> _______________________________________________
> jgrapht-users mailing list
> jgr...@li...
> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
>
>

[jgrapht-users] Please upload latest to maven repo

[Venkat K <ven...@go...>]

Hi JGraphT Team,

I looked at the javadocs for JGraphT and I really liked it. However, I do
not see the latest versions uploaded in maven. The last I upload I see is
for version 0.7.3. Can you please upload the latest stable version to both
these places.

http://mvnrepository.com/artifact/jgrapht/jgrapht
http://search.maven.org/#search%7Cga%7C1%7Cjgrapht

Thanks,

Venkat

Re: [jgrapht-users] Exporting Vertex Names and Edge Weights with GraphML Exporter

[Sebastian M. <woo...@gm...>]

Hi Thomas,

below is my saveToGraphML method. I use providers to set vertex and edge 
IDs and weights. I use the edge label to save their weight. Not sure if 
that's the correct way, but it does the trick as long as you don't need 
the labels for other information.

Best,
Sebastian

[code]
/**
      * Saves a graph to GraphML format.
      *
      * @param graph
      * @param filename
      * @throws IOException
      */
     public static void saveToGraphML(final Graph<String, 
MyWeightedEdge> graph,
             String filename) throws IOException {
         //GraphMLExporter<String, MyWeightedEdge> exporter = new 
GraphMLExporter<String, MyWeightedEdge>();

         // In order to be able to export edge and node labels and IDs, 
we must implement providers for them
         VertexNameProvider<String> vertexIDProvider = new 
VertexNameProvider<String>() {

             @Override
             public String getVertexName(String vertex) {
                 return vertex;
             }
         };

         VertexNameProvider<String> vertexNameProvider = new 
VertexNameProvider<String>() {

             @Override
             public String getVertexName(String vertex) {
                 return vertex;
             }
         };

         EdgeNameProvider<MyWeightedEdge> edgeIDProvider = new 
EdgeNameProvider<MyWeightedEdge>() {

             @Override
             public String getEdgeName(MyWeightedEdge edge) {
                 return graph.getEdgeSource(edge) + " > " + 
graph.getEdgeTarget(edge);
             }
         };

         EdgeNameProvider<MyWeightedEdge> edgeLabelProvider = new 
EdgeNameProvider<MyWeightedEdge>() {

             @Override
             public String getEdgeName(MyWeightedEdge edge) {
                 return graph.getEdgeWeight(edge);
             }
         };

         GraphMLExporter<String, MyWeightedEdge> exporter =
             new GraphMLExporter<String, 
MyWeightedEdge>(vertexIDProvider, vertexNameProvider, edgeIDProvider, 
edgeLabelProvider);

         FileWriter fw = new FileWriter(filename);

         try {
             exporter.export(fw, graph);
         } catch (TransformerConfigurationException e) {
             // TODO Auto-generated catch block
             e.printStackTrace();
         } catch (SAXException e) {
             // TODO Auto-generated catch block
             e.printStackTrace();
         }
     }
[/code]

On 07/23/2013 02:42 PM, Thomas Hupperich wrote:
> Hello,
>
> I am using jgrapht for my research since a few months and came across
> the export function. As newer versions of MS Visio do not support csv
> file format and - more important - open formats are to be prefered, I
> tried to export a graph with the built-in GraphMLExporter.
>
> Unfortunately there seems no vertex names or edge weights to be exported
> (although I am sure, I am making a mistake here), because when I open
> the exported .graphml file with yEd or Gephi there are no values of
> vertexes and edges.
>
> I already read that there are NameProvider-classes but I could not
> figure out how to use them or even if they are the way to go here.
>
> So, I would like to export a graph using GraphML where the vertexes have
> names like created in the programm ("A", "B", "C") and the edges have
> weights like set in the programm (1, 2, 3).
> Here is a very small example class and I hope anybody could help me out
> on this issue.
>
> Thank you for reading so far!
>
> Here is the programm code:
>
> import java.io.FileWriter;
> import java.io.IOException;
> import javax.xml.transform.TransformerConfigurationException;
> import org.jgrapht.ext.GraphMLExporter;
> import org.jgrapht.graph.DefaultWeightedEdge;
> import org.jgrapht.graph.SimpleDirectedWeightedGraph;
> import org.xml.sax.SAXException;
>
> public class WIC {
> 	
> 	public SimpleDirectedWeightedGraph<String, DefaultWeightedEdge> g;
> 	
> 	public WIC(){
> 		g = new
> SimpleDirectedWeightedGraph<String,DefaultWeightedEdge>(DefaultWeightedEdge.class);
> 	}
> 	
> 	private void test(){
> 		g.addVertex("A");
> 		g.addVertex("B");
> 		g.addVertex("C");
> 		makeEdge("A","B",1);
> 		makeEdge("B","A",2);
> 		makeEdge("A","C",3);
> 	}
> 	
> 	private void makeEdge(String A, String B, int w){
> 		DefaultWeightedEdge e = g.addEdge(A,B);
> 		g.setEdgeWeight(e, w);
> 	}
> 	
> 	public static void main(String[] args){
> 		WIC wic = new WIC();
> 		wic.test();
> 		
> 		GraphMLExporter VE = new GraphMLExporter();
> 		FileWriter PS;
> 		try {
> 			PS = new FileWriter("C:/TestData/graph.graphml");
> 			VE.export(PS, wic.g);
> 		} catch (IOException | TransformerConfigurationException |
> SAXException e) {e.printStackTrace();}
> 	}
>
> }
>
> ------------------------------------------------------------------------------
> See everything from the browser to the database with AppDynamics
> Get end-to-end visibility with application monitoring from AppDynamics
> Isolate bottlenecks and diagnose root cause in seconds.
> Start your free trial of AppDynamics Pro today!
> http://pubads.g.doubleclick.net/gampad/clk?id=48808831&iu=/4140/ostg.clktrk
> _______________________________________________
> jgrapht-users mailing list
> jgr...@li...
> https://lists.sourceforge.net/lists/listinfo/jgrapht-users

[jgrapht-users] Exporting Vertex Names and Edge Weights with GraphML Exporter

[Thomas H. <tho...@ru...>]

Hello,

I am using jgrapht for my research since a few months and came across
the export function. As newer versions of MS Visio do not support csv
file format and - more important - open formats are to be prefered, I
tried to export a graph with the built-in GraphMLExporter.

Unfortunately there seems no vertex names or edge weights to be exported
(although I am sure, I am making a mistake here), because when I open
the exported .graphml file with yEd or Gephi there are no values of
vertexes and edges.

I already read that there are NameProvider-classes but I could not
figure out how to use them or even if they are the way to go here.

So, I would like to export a graph using GraphML where the vertexes have
names like created in the programm ("A", "B", "C") and the edges have
weights like set in the programm (1, 2, 3).
Here is a very small example class and I hope anybody could help me out
on this issue.

Thank you for reading so far!

Here is the programm code:

import java.io.FileWriter;
import java.io.IOException;
import javax.xml.transform.TransformerConfigurationException;
import org.jgrapht.ext.GraphMLExporter;
import org.jgrapht.graph.DefaultWeightedEdge;
import org.jgrapht.graph.SimpleDirectedWeightedGraph;
import org.xml.sax.SAXException;

public class WIC {
	
	public SimpleDirectedWeightedGraph<String, DefaultWeightedEdge> g;
	
	public WIC(){
		g = new
SimpleDirectedWeightedGraph<String,DefaultWeightedEdge>(DefaultWeightedEdge.class);
	}
	
	private void test(){
		g.addVertex("A");
		g.addVertex("B");
		g.addVertex("C");
		makeEdge("A","B",1);
		makeEdge("B","A",2);
		makeEdge("A","C",3);
	}
	
	private void makeEdge(String A, String B, int w){
		DefaultWeightedEdge e = g.addEdge(A,B);
		g.setEdgeWeight(e, w);
	}
	
	public static void main(String[] args){
		WIC wic = new WIC();
		wic.test();
		
		GraphMLExporter VE = new GraphMLExporter();
		FileWriter PS;
		try {
			PS = new FileWriter("C:/TestData/graph.graphml");
			VE.export(PS, wic.g);
		} catch (IOException | TransformerConfigurationException |
SAXException e) {e.printStackTrace();}
	}

}

Re: [jgrapht-users] Licensing: Dual license JGraphT under EPL and LGPL

[Oliver K. <ko...@gm...>]

Hi,

Nearly two months later, the status is as follows:
(See also https://github.com/jgrapht/jgrapht/wiki/Relicensing)

Total unique contributors: 58
No rejections.
Pending answers: 8

>From the remaining 8, I think, I have not guessed the right contact
data. Does anyone of you know

 * Avner Linder
 * Harshal Vora
 * Holger Brandl
 * Khanh Vu
 * Lucas J. Scharenbroich
 * Michael Behrisch
 * Tim Engler
 * George Paschos

Feel free to write me a private message to avoid circulating personal
details in the web!

Thank you in advance and greetings,

Oliver

Re: [jgrapht-users] Topological sort ... branch behavior

[Sebastian M. <woo...@gm...>]

Hi Cecilia,

I'm not a jgrapht developer, but your example sounds like depth-first 
search. There is a *org.jgrapht.traverse.DepthFirstIterator<V,E>* class 
for that.

Looking at the code of TopoligicalOrderIterator, the list of verteces is 
sorted by indegree, which makes changing it to suit your example rather 
complicated.


Sebastian


Am 20.07.2013 17:04, schrieb Cecilia Arenas:
>
> Hello,
>
> I'm using Jgrapht to do a topological sort and I would like to get a 
> specific behavior when finding branches:
>
> Here's my example:
>
> I have
>
> Path 1: A - B - C - 1D - 1E - 1F
>
> Path 2: A - B - C - 2D - 2E - 2F
>
> What I would like to have after using the topological sort is:
> Either:
> A - B - C - 1D - 1E - 1F - 2D - 2E - 2F
>
> Or
> A - B - C - 2D - 2E - 2F - 1D - 1E - 1F
>
>
> But what I get when using the Class TopologicalOrderIterator is:
>
> A - B - C - 1D - 2D - 1E - 2E - 1F - 2F
>
> Anyone could give me any suggestion about how to adapt the 
> TopologicalOrderIerator or anything that might help me ?
>
> Cheers,
>
> -- 
> Cecilia Arenas
>
>
> ------------------------------------------------------------------------------
> See everything from the browser to the database with AppDynamics
> Get end-to-end visibility with application monitoring from AppDynamics
> Isolate bottlenecks and diagnose root cause in seconds.
> Start your free trial of AppDynamics Pro today!
> http://pubads.g.doubleclick.net/gampad/clk?id=48808831&iu=/4140/ostg.clktrk
>
>
> _______________________________________________
> jgrapht-users mailing list
> jgr...@li...
> https://lists.sourceforge.net/lists/listinfo/jgrapht-users

[jgrapht-users] Topological sort ... branch behavior

[Cecilia A. <cec...@gm...>]

Hello,

I'm using Jgrapht to do a topological sort and I would like to get a
specific behavior when finding branches:

Here's my example:

I have

Path 1: A - B - C - 1D - 1E - 1F

Path 2: A - B - C - 2D - 2E - 2F

What I would like to have after using the topological sort is:
Either:
A - B - C - 1D - 1E - 1F - 2D - 2E - 2F

Or
A - B - C - 2D - 2E - 2F - 1D - 1E - 1F


But what I get when using the Class TopologicalOrderIterator is:

A - B - C - 1D - 2D - 1E - 2E - 1F - 2F

Anyone could give me any suggestion about how to adapt the
TopologicalOrderIerator or anything that might help me ?

Cheers,

-- 
Cecilia Arenas