jgrapht-users — JGraphT user list.

Re: [jgrapht-users] ismorphism

[Rushang K. <rus...@ho...>]

Thanks Fabian!!
 
Are you going to contributing a C++ port in Boost as well?
 
Date: Sun, 12 Jul 2015 14:19:00 -0700
From: js...@gm...
To: jgr...@li...
CC: fab...@un...
Subject: [jgrapht-users] ismorphism

Hey folks,
Fabian Späh and his colleagues at the University of Constance have contributed an implementation of the VF2 graph isomorphism and subgraph isomorphism matching algorithm.
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=1323804

I've merged it into trunk.  I've also deleted the old isomorphism implementation from the experimental package.  Although the world still waits in breathless anticipation to learn whether there exists a guaranteed polynomial-time solution for isomorphism over arbitrary graphs, the VF2 algorithm should beat the old brute-force implementation in just about any case you can think of.
Thanks Fabian!
JVS



------------------------------------------------------------------------------
Don't Limit Your Business. Reach for the Cloud.
GigeNET's Cloud Solutions provide you with the tools and support that
you need to offload your IT needs and focus on growing your business.
Configured For All Businesses. Start Your Cloud Today.
https://www.gigenetcloud.com/
_______________________________________________
jgrapht-users mailing list
jgr...@li...
https://lists.sourceforge.net/lists/listinfo/jgrapht-users 		 	   		  

[jgrapht-users] ismorphism

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

Hey folks,

Fabian Späh and his colleagues at the University of Constance have
contributed an implementation of the VF2 graph isomorphism and subgraph
isomorphism matching algorithm.

http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=1323804

I've merged it into trunk.  I've also deleted the old isomorphism
implementation from the experimental package.  Although the world still
waits in breathless anticipation to learn whether there exists a guaranteed
polynomial-time solution for isomorphism over arbitrary graphs, the VF2
algorithm should beat the old brute-force implementation in just about any
case you can think of.

Thanks Fabian!

JVS

[jgrapht-users] Edmonds Blossom Algorithm (Infinite Loop Error)

[Syed <ale...@ho...>]

Hi Experts,
I am trying to test Edmonds Blossom Shrinking, but it is going into
inifinite loop for my graph: Do you have any idea why?

    DefaultEdge e12 = g.addEdge(v1, v2);
    DefaultEdge e13 = g.addEdge(v1, v3);
    DefaultEdge e23 = g.addEdge(v2, v3);
    DefaultEdge e24 = g.addEdge(v2, v4);
    DefaultEdge e34 = g.addEdge(v3, v4);
    DefaultEdge e35 = g.addEdge(v3, v5);
    DefaultEdge e45 = g.addEdge(v4, v5);
Regards,



--
View this message in context: http://jgrapht-users.107614.n3.nabble.com/Edmonds-Blossom-Algorithm-Infinite-Loop-Error-tp4025018.html
Sent from the jgrapht-users mailing list archive at Nabble.com.

Re: [jgrapht-users] Edmonds blossom-query

[Szabolcs B. <bes...@gm...>]

I could manage to reproduce the problem (even for smaller graphs) but as
I'm not familiar with the algorithm I suggest to submit an issue on the
project site.
​
R
​egards,
​
Szabolcs

2015-07-09 19:54 GMT+02:00 Syed <ale...@ho...>:

> Hi, Thanks for your response.
>
> Edmonds algorithm is getting into inifinite loop for my graph: Do you have
> any idea why?
>
> Here are my edges.
>
>
>         DefaultEdge e12 = g.addEdge(v1, v2);
>         DefaultEdge e13 = g.addEdge(v1, v3);
>         DefaultEdge e23 = g.addEdge(v2, v3);
>         DefaultEdge e24 = g.addEdge(v2, v4);
>         DefaultEdge e34 = g.addEdge(v3, v4);
>         DefaultEdge e35 = g.addEdge(v3, v5);
>         DefaultEdge e45 = g.addEdge(v4, v5);
>
> Thanks again for your help. I am really stuck in to it.
>
>
> Regards,
>
>
>
> --
> View this message in context:
> http://jgrapht-users.107614.n3.nabble.com/Edmonds-blossom-query-tp4025012p4025016.html
> Sent from the jgrapht-users mailing list archive at Nabble.com.
>
>
> ------------------------------------------------------------------------------
> Don't Limit Your Business. Reach for the Cloud.
> GigeNET's Cloud Solutions provide you with the tools and support that
> you need to offload your IT needs and focus on growing your business.
> Configured For All Businesses. Start Your Cloud Today.
> https://www.gigenetcloud.com/
> _______________________________________________
> jgrapht-users mailing list
> jgr...@li...
> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
>

Re: [jgrapht-users] Edmonds blossom-query

[Syed <ale...@ho...>]

Hi, Thanks for your response. 

Edmonds algorithm is getting into inifinite loop for my graph: Do you have
any idea why?

Here are my edges. 


        DefaultEdge e12 = g.addEdge(v1, v2);
        DefaultEdge e13 = g.addEdge(v1, v3);
        DefaultEdge e23 = g.addEdge(v2, v3);
        DefaultEdge e24 = g.addEdge(v2, v4);
        DefaultEdge e34 = g.addEdge(v3, v4);
        DefaultEdge e35 = g.addEdge(v3, v5);
        DefaultEdge e45 = g.addEdge(v4, v5);

Thanks again for your help. I am really stuck in to it. 


Regards,



--
View this message in context: http://jgrapht-users.107614.n3.nabble.com/Edmonds-blossom-query-tp4025012p4025016.html
Sent from the jgrapht-users mailing list archive at Nabble.com.

Re: [jgrapht-users] Edmonds blossom-query

[Szabolcs B. <bes...@gm...>]

Create a simple Maven project and add jgrapht-core as dependency. After
that you can simply test the EdmondsBlossomShrinking algorithm, where *g*
is your graph of choice:

EdmondsBlossomShrinking<Integer, DefaultEdge> matcher =
        new EdmondsBlossomShrinking<Integer, DefaultEdge>(g);

Get the matching set and print it out:

Set<DefaultEdge> match = matcher.getMatching();

for (DefaultEdge edge : match) {
    System.out.println(edge);
}

(I hope the formatting looks okay)


​Regards,

Szabolcs

2015-07-09 18:20 GMT+02:00 Syed <ale...@ho...>:

> Thanks,
>
> Can you tell how to see the matching results, it doesnt print anything.
>
>
> Sorry for silly questions, i am totally new to this stuff.
>
>
>
>
> --
> View this message in context:
> http://jgrapht-users.107614.n3.nabble.com/Edmonds-blossom-query-tp4025012p4025014.html
> Sent from the jgrapht-users mailing list archive at Nabble.com.
>
>
> ------------------------------------------------------------------------------
> Don't Limit Your Business. Reach for the Cloud.
> GigeNET's Cloud Solutions provide you with the tools and support that
> you need to offload your IT needs and focus on growing your business.
> Configured For All Businesses. Start Your Cloud Today.
> https://www.gigenetcloud.com/
> _______________________________________________
> jgrapht-users mailing list
> jgr...@li...
> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
>

Re: [jgrapht-users] Edmonds blossom-query

[Syed <ale...@ho...>]

Thanks, 

Can you tell how to see the matching results, it doesnt print anything.


Sorry for silly questions, i am totally new to this stuff.




--
View this message in context: http://jgrapht-users.107614.n3.nabble.com/Edmonds-blossom-query-tp4025012p4025014.html
Sent from the jgrapht-users mailing list archive at Nabble.com.

Re: [jgrapht-users] Edmonds blossom-query

[Szabolcs B. <bes...@gm...>]

That's a class of the JUnit testing framework. You can read more here:
http://junit.org/ .

​Regards,

Szabolcs

2015-07-09 17:49 GMT+02:00 Ali Muhammad <ale...@ho...>:

> Hi Experts,
>
> I am new to java and am trying to test Edmonds blossom implementation, the
> test file : EdmondsBlossomShrinkingTest extends TestCase, where do i find
> this TestCase file?
>
>
> Thanks in advance.
>
>
> ------------------------------------------------------------------------------
> Don't Limit Your Business. Reach for the Cloud.
> GigeNET's Cloud Solutions provide you with the tools and support that
> you need to offload your IT needs and focus on growing your business.
> Configured For All Businesses. Start Your Cloud Today.
> https://www.gigenetcloud.com/
> _______________________________________________
> jgrapht-users mailing list
> jgr...@li...
> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
>
>

[jgrapht-users] Edmonds blossom-query

[Ali M. <ale...@ho...>]

Hi Experts, I am new to java and am trying to test Edmonds blossom implementation, the test file : EdmondsBlossomShrinkingTest extends TestCase, where do i find this TestCase file? Thanks in advance.  		 	   		  

[jgrapht-users] Edmonds Blossom Shrinking - Test Case

[Syed <ale...@ho...>]

Hi Experts, 

I am new to java and am trying to test Edmonds blossom implementation, the
test file : EdmondsBlossomShrinkingTest extends TestCase, where do i find
this TestCase file? 


Thanks in advance.




--
View this message in context: http://jgrapht-users.107614.n3.nabble.com/Edmonds-Blossom-Shrinking-Test-Case-tp4025011.html
Sent from the jgrapht-users mailing list archive at Nabble.com.

Re: [jgrapht-users] Edge weights

[Szabolcs B. <bes...@gm...>]

As the exception states, you are adding an edge to your graph which results
in a loop which is not permitted for the type of graph you are currently
working with. Consider using a DirectedPseudograph
<http://mathworld.wolfram.com/Pseudograph.html>.

​Regards,​

Besenyei Szabolcs

2015-07-02 17:15 GMT+02:00 fee...@gm... <fee...@gm...>:

> Thank you guys for your replies… I’ve made some changes in my simple code
> taking into account your advice…..however I’m still getting this error:
>
> Exception in thread "main" java.lang.IllegalArgumentException: loops not
> allowed
> ÏÏ§Ï        at
> org.jgrapht.graph.AbstractBaseGraph.addEdge(AbstractBaseGraph.java:243)
> ÏÏ§Ï        at org.jgrapht.Graphs.addEdge(Graphs.java:88)
> ÏÏ§Ï        at JGraphTestDirected.main(JGraphTestDirected.java:77)
>
>
> My plan is simple…take a matrix with weights…….two for loops to go through
> it for creating edges and adding weights.
>
>
> any help will be appreciated.
>
>
> Phil
>
>
>
> On 1/07/2015, at 7:26 pm, Joris Kinable <de...@gm...> wrote:
>
> Three ways to add weighted edges:
>
> 1. Use the graph itself:
> DefaultWeightedEdge e=graph.addEdge(V vertex1, V vertex2);
> graph.setEdgeWeight(e, double weight);
>
> 2. Use one of the following methods in the Graphs package:
> Graphs.addAllEdges(Graph<? super V,? super E> destination, Graph<V,E>
> source, Collection<? extends E> edges)
> Graphs.addEdge(Graph<V,E> g, V sourceVertex, V targetVertex, double weight)
> Graphs.addEdgeWithVertices(Graph<V,E> targetGraph, Graph<V,E> sourceGraph,
> E edge, double weight)
>
> 3. Use the Graph Builder which was added to the latest version of jgrapht:
> SimpleWeightedGraph<String, DefaultWeightedEdge> builtWeightedGraph =
>         SimpleWeightedGraph.<String, DefaultWeightedEdge>
>         builder(DefaultWeightedEdge.class)
>         .addEdge(v1, v2, 1.0)
>         .addEdge(v1, v2, 2.0)
>         .addEdge(v3, v4, 3.0)
>         .addEdge(v2, v4, 2.0)
>         .build();
>
>
> br,
>
> Joris Kinable
>
> On Wed, Jul 1, 2015 at 7:13 PM, Rushang Karia <rus...@ho...>
> wrote:
>
>> I am at work right now and do not remember if such a function exists (not
>> worked on weighted graphs a lot). I guess there should be such a function
>> since your problem is quite intuitive.
>>
>> However,
>> If no such function exists then you could overload the addEdge() to
>> specify a weight for the WeightedGraph.
>> The function would be
>>
>> DefaultWeightedEdge  <V, E> addEdge(V v1, V v2, E weight)
>> {
>>         DefaultWeightedEdge e1 = super.addEdge(v1, v2);
>>         this.setEdgeWeight(e1, weight)
>>         If(error) return null else return the edge.
>> }
>>
>> I am sorry if my reply is brief but I am a bit busy right now. If you
>> need more detailed instructions feel free to reply.
>>
>> -----Original Message-----
>> From: fee...@gm... [mailto:fee...@gm...]
>> Sent: Wednesday, July 01, 2015 4:05 PM
>> To: jgr...@li...
>> Subject: [jgrapht-users] Edge weights
>>
>> Hi there,
>>
>> I’m a newbie using Jgrapht… .My problem  has to do with a large weighted
>> graph (about 2000 edges)   and the assignation of its weights.
>>
>> All I wanna ask is whether or not weights for a graph can be assigned
>> dynamically  (a loop) rather than static (one by on)...like:
>>
>> DefaultWeightedEdge e1 = graph.addEdge("vertex1", "vertex2”);
>> graph.setEdgeWeight(e1, 5);
>>
>> (I’d have to write this thousand times…. )
>>
>>
>> Thanks.
>>
>> Phil
>>
>>
>>
>> ------------------------------------------------------------------------------
>> Don't Limit Your Business. Reach for the Cloud.
>> GigeNET's Cloud Solutions provide you with the tools and support that you
>> need to offload your IT needs and focus on growing your business.
>> Configured For All Businesses. Start Your Cloud Today.
>> https://www.gigenetcloud.com/
>> _______________________________________________
>> jgrapht-users mailing list
>> jgr...@li...
>> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
>>
>>
>>
>> ------------------------------------------------------------------------------
>> Don't Limit Your Business. Reach for the Cloud.
>> GigeNET's Cloud Solutions provide you with the tools and support that
>> you need to offload your IT needs and focus on growing your business.
>> Configured For All Businesses. Start Your Cloud Today.
>> https://www.gigenetcloud.com/
>> _______________________________________________
>> jgrapht-users mailing list
>> jgr...@li...
>> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
>>
>
>
>
>
> ------------------------------------------------------------------------------
> Don't Limit Your Business. Reach for the Cloud.
> GigeNET's Cloud Solutions provide you with the tools and support that
> you need to offload your IT needs and focus on growing your business.
> Configured For All Businesses. Start Your Cloud Today.
> https://www.gigenetcloud.com/
> _______________________________________________
> jgrapht-users mailing list
> jgr...@li...
> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
>
>

Re: [jgrapht-users] Edge weights

[<fee...@gm...>]

Thank you guys for your replies… I’ve made some changes in my simple code taking into account your advice…..however I’m still getting this error:

Exception in thread "main" java.lang.IllegalArgumentException: loops not allowed
ÏÏ§Ï        at org.jgrapht.graph.AbstractBaseGraph.addEdge(AbstractBaseGraph.java:243)
ÏÏ§Ï        at org.jgrapht.Graphs.addEdge(Graphs.java:88)
ÏÏ§Ï        at JGraphTestDirected.main(JGraphTestDirected.java:77)


My plan is simple…take a matrix with weights…….two for loops to go through it for creating edges and adding weights.


any help will be appreciated.


Phil



> On 1/07/2015, at 7:26 pm, Joris Kinable <de...@gm...> wrote:
> 
> Three ways to add weighted edges:
> 
> 1. Use the graph itself:
> DefaultWeightedEdge e=graph.addEdge(V vertex1, V vertex2);
> graph.setEdgeWeight(e, double weight);
> 
> 2. Use one of the following methods in the Graphs package:
> Graphs.addAllEdges(Graph<? super V,? super E> destination, Graph<V,E> source, Collection<? extends E> edges)
> Graphs.addEdge(Graph<V,E> g, V sourceVertex, V targetVertex, double weight)
> Graphs.addEdgeWithVertices(Graph<V,E> targetGraph, Graph<V,E> sourceGraph, E edge, double weight)
> 
> 3. Use the Graph Builder which was added to the latest version of jgrapht:
> SimpleWeightedGraph<String, DefaultWeightedEdge> builtWeightedGraph =
>         SimpleWeightedGraph.<String, DefaultWeightedEdge>
>         builder(DefaultWeightedEdge.class)
>         .addEdge(v1, v2, 1.0)
>         .addEdge(v1, v2, 2.0)
>         .addEdge(v3, v4, 3.0)
>         .addEdge(v2, v4, 2.0)
>         .build();
> 
> 
> br,
> 
> Joris Kinable
> 
> On Wed, Jul 1, 2015 at 7:13 PM, Rushang Karia <rus...@ho... <mailto:rus...@ho...>> wrote:
> I am at work right now and do not remember if such a function exists (not worked on weighted graphs a lot). I guess there should be such a function since your problem is quite intuitive.
> 
> However,
> If no such function exists then you could overload the addEdge() to specify a weight for the WeightedGraph.
> The function would be
> 
> DefaultWeightedEdge  <V, E> addEdge(V v1, V v2, E weight)
> {
>         DefaultWeightedEdge e1 = super.addEdge(v1, v2);
>         this.setEdgeWeight(e1, weight)
>         If(error) return null else return the edge.
> }
> 
> I am sorry if my reply is brief but I am a bit busy right now. If you need more detailed instructions feel free to reply.
> 
> -----Original Message-----
> From: fee...@gm... <mailto:fee...@gm...> [mailto:fee...@gm... <mailto:fee...@gm...>]
> Sent: Wednesday, July 01, 2015 4:05 PM
> To: jgr...@li... <mailto:jgr...@li...>
> Subject: [jgrapht-users] Edge weights
> 
> Hi there,
> 
> I’m a newbie using Jgrapht… .My problem  has to do with a large weighted graph (about 2000 edges)   and the assignation of its weights.
> 
> All I wanna ask is whether or not weights for a graph can be assigned dynamically  (a loop) rather than static (one by on)...like:
> 
> DefaultWeightedEdge e1 = graph.addEdge("vertex1", "vertex2”); graph.setEdgeWeight(e1, 5);
> 
> (I’d have to write this thousand times…. )
> 
> 
> Thanks.
> 
> Phil
> 
> 
> ------------------------------------------------------------------------------
> Don't Limit Your Business. Reach for the Cloud.
> GigeNET's Cloud Solutions provide you with the tools and support that you need to offload your IT needs and focus on growing your business.
> Configured For All Businesses. Start Your Cloud Today.
> https://www.gigenetcloud.com/ <https://www.gigenetcloud.com/>
> _______________________________________________
> jgrapht-users mailing list
> jgr...@li... <mailto:jgr...@li...>
> https://lists.sourceforge.net/lists/listinfo/jgrapht-users <https://lists.sourceforge.net/lists/listinfo/jgrapht-users>
> 
> 
> ------------------------------------------------------------------------------
> Don't Limit Your Business. Reach for the Cloud.
> GigeNET's Cloud Solutions provide you with the tools and support that
> you need to offload your IT needs and focus on growing your business.
> Configured For All Businesses. Start Your Cloud Today.
> https://www.gigenetcloud.com/ <https://www.gigenetcloud.com/>
> _______________________________________________
> jgrapht-users mailing list
> jgr...@li... <mailto:jgr...@li...>
> https://lists.sourceforge.net/lists/listinfo/jgrapht-users <https://lists.sourceforge.net/lists/listinfo/jgrapht-users>
> 

Re: [jgrapht-users] Edge weights

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

Three ways to add weighted edges:

1. Use the graph itself:
DefaultWeightedEdge e=graph.addEdge(V vertex1, V vertex2);
graph.setEdgeWeight(e, double weight);

2. Use one of the following methods in the Graphs package:
Graphs.addAllEdges(Graph<? super V,? super E> destination, Graph<V,E>
source, Collection<? extends E> edges)
Graphs.addEdge(Graph<V,E> g, V sourceVertex, V targetVertex, double weight)
Graphs.addEdgeWithVertices(Graph<V,E> targetGraph, Graph<V,E> sourceGraph,
E edge, double weight)

3. Use the Graph Builder which was added to the latest version of jgrapht:
SimpleWeightedGraph<String, DefaultWeightedEdge> builtWeightedGraph =
        SimpleWeightedGraph.<String, DefaultWeightedEdge>
        builder(DefaultWeightedEdge.class)
        .addEdge(v1, v2, 1.0)
        .addEdge(v1, v2, 2.0)
        .addEdge(v3, v4, 3.0)
        .addEdge(v2, v4, 2.0)
        .build();


br,

Joris Kinable

On Wed, Jul 1, 2015 at 7:13 PM, Rushang Karia <rus...@ho...>
wrote:

> I am at work right now and do not remember if such a function exists (not
> worked on weighted graphs a lot). I guess there should be such a function
> since your problem is quite intuitive.
>
> However,
> If no such function exists then you could overload the addEdge() to
> specify a weight for the WeightedGraph.
> The function would be
>
> DefaultWeightedEdge  <V, E> addEdge(V v1, V v2, E weight)
> {
>         DefaultWeightedEdge e1 = super.addEdge(v1, v2);
>         this.setEdgeWeight(e1, weight)
>         If(error) return null else return the edge.
> }
>
> I am sorry if my reply is brief but I am a bit busy right now. If you need
> more detailed instructions feel free to reply.
>
> -----Original Message-----
> From: fee...@gm... [mailto:fee...@gm...]
> Sent: Wednesday, July 01, 2015 4:05 PM
> To: jgr...@li...
> Subject: [jgrapht-users] Edge weights
>
> Hi there,
>
> I’m a newbie using Jgrapht… .My problem  has to do with a large weighted
> graph (about 2000 edges)   and the assignation of its weights.
>
> All I wanna ask is whether or not weights for a graph can be assigned
> dynamically  (a loop) rather than static (one by on)...like:
>
> DefaultWeightedEdge e1 = graph.addEdge("vertex1", "vertex2”);
> graph.setEdgeWeight(e1, 5);
>
> (I’d have to write this thousand times…. )
>
>
> Thanks.
>
> Phil
>
>
>
> ------------------------------------------------------------------------------
> Don't Limit Your Business. Reach for the Cloud.
> GigeNET's Cloud Solutions provide you with the tools and support that you
> need to offload your IT needs and focus on growing your business.
> Configured For All Businesses. Start Your Cloud Today.
> https://www.gigenetcloud.com/
> _______________________________________________
> jgrapht-users mailing list
> jgr...@li...
> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
>
>
>
> ------------------------------------------------------------------------------
> Don't Limit Your Business. Reach for the Cloud.
> GigeNET's Cloud Solutions provide you with the tools and support that
> you need to offload your IT needs and focus on growing your business.
> Configured For All Businesses. Start Your Cloud Today.
> https://www.gigenetcloud.com/
> _______________________________________________
> jgrapht-users mailing list
> jgr...@li...
> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
>

Re: [jgrapht-users] Edge weights

[Rushang K. <rus...@ho...>]

I am at work right now and do not remember if such a function exists (not worked on weighted graphs a lot). I guess there should be such a function since your problem is quite intuitive.

However,
If no such function exists then you could overload the addEdge() to specify a weight for the WeightedGraph.
The function would be

DefaultWeightedEdge  <V, E> addEdge(V v1, V v2, E weight)
{
	DefaultWeightedEdge e1 = super.addEdge(v1, v2);
	this.setEdgeWeight(e1, weight)
	If(error) return null else return the edge.
}

I am sorry if my reply is brief but I am a bit busy right now. If you need more detailed instructions feel free to reply.

-----Original Message-----
From: fee...@gm... [mailto:fee...@gm...] 
Sent: Wednesday, July 01, 2015 4:05 PM
To: jgr...@li...
Subject: [jgrapht-users] Edge weights

Hi there,  

I’m a newbie using Jgrapht… .My problem  has to do with a large weighted graph (about 2000 edges)   and the assignation of its weights.

All I wanna ask is whether or not weights for a graph can be assigned dynamically  (a loop) rather than static (one by on)...like:

DefaultWeightedEdge e1 = graph.addEdge("vertex1", "vertex2”); graph.setEdgeWeight(e1, 5);

(I’d have to write this thousand times…. )


Thanks.

Phil


------------------------------------------------------------------------------
Don't Limit Your Business. Reach for the Cloud.
GigeNET's Cloud Solutions provide you with the tools and support that you need to offload your IT needs and focus on growing your business.
Configured For All Businesses. Start Your Cloud Today.
https://www.gigenetcloud.com/
_______________________________________________
jgrapht-users mailing list
jgr...@li...
https://lists.sourceforge.net/lists/listinfo/jgrapht-users

[jgrapht-users] Edge weights

[<fee...@gm...>]

Hi there,  

I’m a newbie using Jgrapht… .My problem  has to do with a large weighted graph (about 2000 edges)   and the assignation of its weights.

All I wanna ask is whether or not weights for a graph can be assigned dynamically  (a loop) rather than static (one by on)...like:

DefaultWeightedEdge e1 = graph.addEdge("vertex1", "vertex2”); 
graph.setEdgeWeight(e1, 5);

(I’d have to write this thousand times…. )


Thanks.

Phil

Re: [jgrapht-users] graphbuilder classes?

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

great! thnx.

Joris

On Sat, Jun 27, 2015 at 4:41 PM, John Sichi <js...@gm...> wrote:

> On Thu, Jun 25, 2015 at 11:18 PM, John Sichi <js...@gm...> wrote:
>
>> On Tue, Jun 23, 2015 at 8:36 AM, Joris Kinable <de...@gm...> wrote:
>>
>>> a. Is there a particular reason I cannot find these classes in the
>>> javadoc linked from jgrapht's website: http://jgrapht.org/javadoc/.
>>> Could it be that the javadoc hasn't been updated with the latest release of
>>> jgrapht?
>>>
>>
>> Looks like I must have screwed up the Javadoc refresh when I released
>> 0.9.1, since it still says 0.9.0.  I'll look into that.
>>
>
> I've redone the refresh, correctly this time :)
>
>

Re: [jgrapht-users] graphbuilder classes?

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

On Thu, Jun 25, 2015 at 11:18 PM, John Sichi <js...@gm...> wrote:

> On Tue, Jun 23, 2015 at 8:36 AM, Joris Kinable <de...@gm...> wrote:
>
>> a. Is there a particular reason I cannot find these classes in the
>> javadoc linked from jgrapht's website: http://jgrapht.org/javadoc/.
>> Could it be that the javadoc hasn't been updated with the latest release of
>> jgrapht?
>>
>
> Looks like I must have screwed up the Javadoc refresh when I released
> 0.9.1, since it still says 0.9.0.  I'll look into that.
>

I've redone the refresh, correctly this time :)

Re: [jgrapht-users] Neo4j and JGraphT - A Perfect Team

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

Nice work!

On Fri, Jun 26, 2015 at 6:23 AM, Daniel Murygin <dan...@gm...>
wrote:

> I wrote a blog post about how to get a JGraphT graph object as a
> result from a Neo4j Cypher query. If you are interested you can read
> more here: https://murygin.wordpress.com/2015/06/25/neo4j-cypher-jgrapht/
>
> Have a nice weekend!
> - Daniel
>
> --
> Daniel Murygin - dan...@gm...
>
>
> ------------------------------------------------------------------------------
> Monitor 25 network devices or servers for free with OpManager!
> OpManager is web-based network management software that monitors
> network devices and physical & virtual servers, alerts via email & sms
> for fault. Monitor 25 devices for free with no restriction. Download now
> http://ad.doubleclick.net/ddm/clk/292181274;119417398;o
> _______________________________________________
> jgrapht-users mailing list
> jgr...@li...
> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
>

Re: [jgrapht-users] old jgrapht merge requests

[Szabolcs B. <bes...@gm...>]

I'd love to help
​ ​
y
​ou with ​the review.

​Regards,

Besenyei Szabolcs

2015-06-26 17:57 GMT+02:00 Joris Kinable <de...@gm...>:

> Ok, I'll go over some of them in the next few weeks.
>
> Thanks for your feedback :)
>
> Joris
>
> On Fri, Jun 26, 2015 at 2:26 AM, John Sichi <js...@gm...> wrote:
>
>> On Thu, Jun 25, 2015 at 9:53 AM, Joris Kinable <de...@gm...> wrote:
>>
>>> There are several old jgrapht merge requests including some A* search
>>> implementations, dating back to 2012. What's happening with those? Can we
>>> review/accept/reject them or is there a particular reason they are still
>>> out there?
>>>
>>
>> If you'd like to do the review, go ahead and add your comments, and if
>> one of them gets to an acceptable state, let me know and I can merge the
>> pull request.  Looks like only one of them has a unit test at the moment.
>>
>> Likewise for other open mergeable pull requests.
>>
>>
>
>
> ------------------------------------------------------------------------------
> Monitor 25 network devices or servers for free with OpManager!
> OpManager is web-based network management software that monitors
> network devices and physical & virtual servers, alerts via email & sms
> for fault. Monitor 25 devices for free with no restriction. Download now
> http://ad.doubleclick.net/ddm/clk/292181274;119417398;o
> _______________________________________________
> jgrapht-users mailing list
> jgr...@li...
> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
>
>

Re: [jgrapht-users] old jgrapht merge requests

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

Ok, I'll go over some of them in the next few weeks.

Thanks for your feedback :)

Joris

On Fri, Jun 26, 2015 at 2:26 AM, John Sichi <js...@gm...> wrote:

> On Thu, Jun 25, 2015 at 9:53 AM, Joris Kinable <de...@gm...> wrote:
>
>> There are several old jgrapht merge requests including some A* search
>> implementations, dating back to 2012. What's happening with those? Can we
>> review/accept/reject them or is there a particular reason they are still
>> out there?
>>
>
> If you'd like to do the review, go ahead and add your comments, and if one
> of them gets to an acceptable state, let me know and I can merge the pull
> request.  Looks like only one of them has a unit test at the moment.
>
> Likewise for other open mergeable pull requests.
>
>

[jgrapht-users] Neo4j and JGraphT - A Perfect Team

[Daniel M. <dan...@gm...>]

I wrote a blog post about how to get a JGraphT graph object as a
result from a Neo4j Cypher query. If you are interested you can read
more here: https://murygin.wordpress.com/2015/06/25/neo4j-cypher-jgrapht/

Have a nice weekend!
- Daniel

-- 
Daniel Murygin - dan...@gm...

Re: [jgrapht-users] add edge to directed graph in both directions

[H.N. de R. <hnr...@gr...>]

On Tue, Jun 23, 2015 at 01:27:23PM -0400, Joris Kinable wrote:
> Hm, I remember seeing that thread. The two solutions proposed were:
> 
> 1. Create 2 graphs, a directed and an undirected graph, and create a
> GraphUnion from these two graphs. This approach has 2 major disadvantages:
> 
> 2. To represent an undirected edge e=(i,j) in a directed graph, create 2
> edge objects, say e1 and e2, which contain the same information, and add
> 
> So far, neither of these approaches seem desirable. Any remarks on this?

What is your actual goal? Create a mixed graph without going through the
hassle of implementing a MixedGraph class, or using the same object for two
edges in a graph, as the original post said?

Ernst


-- 
Information System on Graph Classes and their Inclusions (ISGCI)
http://www.graphclasses.org

Re: [jgrapht-users] old jgrapht merge requests

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

On Thu, Jun 25, 2015 at 9:53 AM, Joris Kinable <de...@gm...> wrote:

> There are several old jgrapht merge requests including some A* search
> implementations, dating back to 2012. What's happening with those? Can we
> review/accept/reject them or is there a particular reason they are still
> out there?
>

If you'd like to do the review, go ahead and add your comments, and if one
of them gets to an acceptable state, let me know and I can merge the pull
request.  Looks like only one of them has a unit test at the moment.

Likewise for other open mergeable pull requests.

Re: [jgrapht-users] graphbuilder classes?

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

On Tue, Jun 23, 2015 at 8:36 AM, Joris Kinable <de...@gm...> wrote:

> a. Is there a particular reason I cannot find these classes in the javadoc
> linked from jgrapht's website: http://jgrapht.org/javadoc/. Could it be
> that the javadoc hasn't been updated with the latest release of jgrapht?
>

Looks like I must have screwed up the Javadoc refresh when I released
0.9.1, since it still says 0.9.0.  I'll look into that.


> b. Perhaps a bit of a sensitive point: I'm not entirely sure what these
> classes add to jgrapht? The majority of methods in these builder classes
> were already supported by the default graph classes, or through the Graphs
> class. The only new method I can really see is: 'addEdgeChain(V first, V
> second, V ... rest). I would recommend to add this method to the Graphs
> class, and, unless there's a valid use for these builder classes, consider
> to remove them from jgrapht.
>

The rationale was in this pull request:

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

I tend to think that builders are mostly superfluous in general (not just
in this case), but it's a matter of taste.

[jgrapht-users] old jgrapht merge requests

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

There are several old jgrapht merge requests including some A* search
implementations, dating back to 2012. What's happening with those? Can we
review/accept/reject them or is there a particular reason they are still
out there?

br,

Joris Kinable