You can subscribe to this list here.
2003 
_{Jan}

_{Feb}

_{Mar}

_{Apr}

_{May}

_{Jun}

_{Jul}

_{Aug}

_{Sep}

_{Oct}
(2) 
_{Nov}

_{Dec}


2004 
_{Jan}
(1) 
_{Feb}

_{Mar}

_{Apr}

_{May}

_{Jun}
(1) 
_{Jul}
(1) 
_{Aug}

_{Sep}
(1) 
_{Oct}

_{Nov}

_{Dec}
(2) 
2005 
_{Jan}

_{Feb}
(1) 
_{Mar}
(5) 
_{Apr}
(1) 
_{May}

_{Jun}
(12) 
_{Jul}
(6) 
_{Aug}
(7) 
_{Sep}
(2) 
_{Oct}

_{Nov}
(1) 
_{Dec}

2006 
_{Jan}
(4) 
_{Feb}
(3) 
_{Mar}
(2) 
_{Apr}
(3) 
_{May}
(6) 
_{Jun}
(2) 
_{Jul}
(3) 
_{Aug}
(12) 
_{Sep}
(6) 
_{Oct}
(3) 
_{Nov}
(12) 
_{Dec}

2007 
_{Jan}
(6) 
_{Feb}

_{Mar}
(6) 
_{Apr}
(8) 
_{May}
(2) 
_{Jun}
(8) 
_{Jul}
(2) 
_{Aug}
(3) 
_{Sep}
(7) 
_{Oct}
(3) 
_{Nov}

_{Dec}
(1) 
2008 
_{Jan}
(11) 
_{Feb}
(4) 
_{Mar}
(8) 
_{Apr}
(3) 
_{May}
(4) 
_{Jun}
(1) 
_{Jul}

_{Aug}
(3) 
_{Sep}
(1) 
_{Oct}
(4) 
_{Nov}
(5) 
_{Dec}
(5) 
2009 
_{Jan}
(3) 
_{Feb}
(12) 
_{Mar}
(14) 
_{Apr}
(9) 
_{May}
(8) 
_{Jun}
(1) 
_{Jul}
(4) 
_{Aug}
(10) 
_{Sep}

_{Oct}
(10) 
_{Nov}

_{Dec}
(4) 
2010 
_{Jan}
(9) 
_{Feb}
(16) 
_{Mar}
(14) 
_{Apr}
(19) 
_{May}
(1) 
_{Jun}
(3) 
_{Jul}
(17) 
_{Aug}
(9) 
_{Sep}
(4) 
_{Oct}
(4) 
_{Nov}
(11) 
_{Dec}
(8) 
2011 
_{Jan}
(10) 
_{Feb}
(11) 
_{Mar}
(10) 
_{Apr}
(14) 
_{May}
(6) 
_{Jun}
(8) 
_{Jul}
(9) 
_{Aug}
(11) 
_{Sep}
(13) 
_{Oct}
(7) 
_{Nov}
(9) 
_{Dec}
(1) 
2012 
_{Jan}
(5) 
_{Feb}
(14) 
_{Mar}
(4) 
_{Apr}
(25) 
_{May}
(18) 
_{Jun}
(18) 
_{Jul}
(3) 
_{Aug}
(6) 
_{Sep}
(3) 
_{Oct}
(16) 
_{Nov}
(5) 
_{Dec}
(12) 
2013 
_{Jan}
(1) 
_{Feb}
(6) 
_{Mar}
(14) 
_{Apr}
(34) 
_{May}
(9) 
_{Jun}
(3) 
_{Jul}
(8) 
_{Aug}

_{Sep}
(10) 
_{Oct}
(11) 
_{Nov}
(11) 
_{Dec}
(15) 
2014 
_{Jan}
(2) 
_{Feb}
(6) 
_{Mar}
(11) 
_{Apr}
(12) 
_{May}
(6) 
_{Jun}
(7) 
_{Jul}

_{Aug}
(4) 
_{Sep}
(1) 
_{Oct}
(1) 
_{Nov}
(5) 
_{Dec}
(6) 
2015 
_{Jan}
(15) 
_{Feb}
(4) 
_{Mar}
(7) 
_{Apr}
(8) 
_{May}
(1) 
_{Jun}
(18) 
_{Jul}
(27) 
_{Aug}
(13) 
_{Sep}
(4) 
_{Oct}
(8) 
_{Nov}
(7) 
_{Dec}
(6) 
2016 
_{Jan}
(4) 
_{Feb}
(5) 
_{Mar}

_{Apr}
(15) 
_{May}
(5) 
_{Jun}
(4) 
_{Jul}
(1) 
_{Aug}
(1) 
_{Sep}
(7) 
_{Oct}
(2) 
_{Nov}
(4) 
_{Dec}
(2) 
2017 
_{Jan}
(7) 
_{Feb}
(1) 
_{Mar}
(17) 
_{Apr}
(2) 
_{May}
(1) 
_{Jun}

_{Jul}

_{Aug}
(3) 
_{Sep}
(3) 
_{Oct}

_{Nov}

_{Dec}

S  M  T  W  T  F  S 



1
(4) 
2

3
(1) 
4

5

6

7

8

9

10
(1) 
11
(2) 
12

13

14
(2) 
15

16

17

18

19

20

21

22

23

24

25

26

27

28
(1) 
29

30

31



From: Luc Hogie <Luc.Hogie@in...>  20131028 09:54:18

Good morning, I'm interested in performance techniques for graph algorithms. In particular I would like to know what have been made into JGraphT to make it efficient. Regards, Luc.  Luc Hogie COMRED Research Unit (I3S(CNRSUNS) INRIA) I3S Laboratory, University of Nice Sophia Antipolis http://wwwsop.inria.fr/members/Luc.Hogie/ luc.hogie@... +33 4 89 73 24 25 (office) +33 6 80 91 40 71 (mobile) Skype ID: luchogie 
From: John Sichi <jsichi@gm...>  20131014 18:25:54

That is correct. With the last released version on sourceforge, if you unpack it and run java jar jgraphtjdk1.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) < troy.daniels@...> 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:deus87@...] > *Sent:* Friday, October 11, 2013 12:00 AM > *To:* Daniels, Troy (US SSA) > *Cc:* jgraphtusers@... > *Subject:* Re: [jgraphtusers] 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) < > troy.daniels@...> 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 > _______________________________________________ > jgraphtusers mailing list > jgraphtusers@... > https://lists.sourceforge.net/lists/listinfo/jgraphtusers**** > > ** ** > > >  > 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 > _______________________________________________ > jgraphtusers mailing list > jgraphtusers@... > https://lists.sourceforge.net/lists/listinfo/jgraphtusers > > 
From: Daniels, Troy (US SSA) <troy.daniels@ba...>  20131014 18:19:23

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:deus87@...] Sent: Friday, October 11, 2013 12:00 AM To: Daniels, Troy (US SSA) Cc: jgraphtusers@... Subject: Re: [jgraphtusers] 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) <troy.daniels@...<mailto:troy.daniels@...>> 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 _______________________________________________ jgraphtusers mailing list jgraphtusers@...<mailto:jgraphtusers@...> https://lists.sourceforge.net/lists/listinfo/jgraphtusers 
From: Sebastian Müller <woowlegave@gm...>  20131011 10:18:53

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 > > > _______________________________________________ > jgraphtusers mailing list > jgraphtusers@... > https://lists.sourceforge.net/lists/listinfo/jgraphtusers 
From: Joris Kinable <deus87@gm...>  20131011 04:00:14

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) < troy.daniels@...> 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 > _______________________________________________ > jgraphtusers mailing list > jgraphtusers@... > https://lists.sourceforge.net/lists/listinfo/jgraphtusers > > 
From: Daniels, Troy (US SSA) <troy.daniels@ba...>  20131010 22:44:41

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 
From: John Sichi <jsichi@gm...>  20131003 18:27:14

Everyone seems to want this but no one seems to have time or skills required to make the necessary contribution. http://jgraphtusers.107614.n3.nabble.com/Pleaseuploadlatesttomavenrepotd4024840.html On Tue, Oct 1, 2013 at 3:39 AM, Nuno Oliveira < nunomigueloliveira@...> wrote: > Hi, > > I have some questions about the versioning of JGraphT. > > The current root pom.xml defines the 0.8.3SNAPSHOT version. Since the > version 0.8.4 is > under development shouldn't the root pom.xml define the 0.8.4SNAPSHOT > 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 > _______________________________________________ > jgraphtusers mailing list > jgraphtusers@... > https://lists.sourceforge.net/lists/listinfo/jgraphtusers > > 
From: Joris Kinable <deus87@gm...>  20131001 23:55:20

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 EdmondsKarp 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 pushrelabel 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/webservices/mathprog/mincut.html see: globaldir.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 <ahmed.elmasri@...>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 <deus87@...> 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 st cut in a >> directed graph, but this would require me to invoke the algorithm for every >> st 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 >> _______________________________________________ >> jgraphtusers mailing list >> jgraphtusers@... >> https://lists.sourceforge.net/lists/listinfo/jgraphtusers >> >> > 
From: Ahmed Abdeen Hamed <ahmed.elmasri@gm...>  20131001 19:44:25

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 <deus87@...> 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 st cut in a > directed graph, but this would require me to invoke the algorithm for every > st 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 > _______________________________________________ > jgraphtusers mailing list > jgraphtusers@... > https://lists.sourceforge.net/lists/listinfo/jgraphtusers > > 
From: Joris Kinable <deus87@gm...>  20131001 19:18:26

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 st cut in a directed graph, but this would require me to invoke the algorithm for every st 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 
From: Nuno Oliveira <nunomigueloliveira@pt...>  20131001 10:38:24

Hi, I have some questions about the versioning of JGraphT. The current root pom.xml defines the 0.8.3SNAPSHOT version. Since the version 0.8.4 is under development shouldn't the root pom.xml define the 0.8.4SNAPSHOT version ? Is in our plans to make JGraphT snapshots available on maven central ? When will be the next release ? Thanks. Best regards, Nuno Oliveira 