jgrapht-users — JGraphT user list.

[jgrapht-users] An question on using JgraphT to find all strongly connected components of a directed graph

[Rui C. <cha...@ho...>]

Hi all, I am a newbie in using JGraphT. So, please forgive me if my question is too easy.  I have a directed graph containing many cycles, and I'd like to use JGraphT to find all these cycles (nodes in the cycle) in this directed graph. I am now trying to use the class: StrongConnectivityInspector and its methods: stronglyConnectedSubgraphs. However, it will not return all cycles. 
 Is there a way to use any class in JGraphT to find all cycles?
Thanks!Rui 		 	   		  
_________________________________________________________________
The New Busy is not the old busy. Search, chat and e-mail from your inbox.
http://www.windowslive.com/campaign/thenewbusy?ocid=PID27925::T:WLMTAGL:ON:WL:en-US:WM_HMP:032010_3

[jgrapht-users] all possible paths

[dinesh c. <din...@gm...>]

For a given vertex ,if I want to know all the possible ways(paths) to reach
that vertex? how can I get that.
There may be more than one way to reach a particular vertex in a
DirectedMultiGraph.so how can I get all
Waiting for a quick answer

Thanks

-- 
Regards,
Dinesh Chhatani

Re: [jgrapht-users] jgrapht edge endpoint

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

Hi Szabó,

Please direct all questions to the mailing list (not me personally).

Here is what you are looking for:

http://www.jgrapht.org/javadoc/org/jgrapht/Graph.html#getEdgeSource(E)

Note that JGraphT already includes a BFS:

http://www.jgrapht.org/javadoc/org/jgrapht/traverse/BreadthFirstIterator.html

JVS

Szabó Tamás wrote:
> Hi!
> 
> I just wanted to try your JGrapht library. I wanted to created a class 
> which extends DefaultDirectedGraph<Node<V>, DefaultEdge>.
> Node is also my class. How is it possible to get the two endpoints of an 
> edge?
> I want to write a breadth first search algorithm.
> Thank you for your help and props for the library!
> 
> Best wishes,
> Tamas Szabo
> 

[jgrapht-users] graph query

[dinesh c. <din...@gm...>]

HI,
For a directed multigraph,

I want to visit each node and each edge.Also I want to store the set of
edges and vertices involved during visit of a particular vertex or edge.

Thanks
-- 
Regards,
Dinesh Chhatani

[jgrapht-users] Jgrapgt Tutorials

[Jano N. <jan...@gm...>]

Hi guys,

I am a new jgrapht user and I am finding it challenging to use it without
tutorials. I am using jgrapht for my 4th year project that has the
travelling salesman problem application among a bunch of other
applications-due in the next 6 weeks and I am desperate for tutorials or at
least working examples. I would really appreciate feedback from you.

Regards,
Janet

Re: [jgrapht-users] KShortest Path implementation

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

Arun Iyer wrote:
> Hi,
> I am using JGraphT's KShortestPath implementation. In the code that I 
> have, I have to create a new graph for every run and compute 
> KShortestPath on it. I find that KShortestPath gives the right answers 
> almost all the time, but sometimes, it doesn't give the right answers 
> (on the same graph on which it gave the right answer before). I was 
> wondering, why is this non-deterministic? Is there threading involved 
> (either in graph creation or in k-shortestpath computation) ?

It does not use threading.  It does use HashMaps, which can result in 
non-determinism in cases where ordering is arbitrary.

It would help if you can provide a small isolated test case which can be 
run repeatedly in order to reproduce your problem reliably.  Without 
that, it's impossible to find and fix it.

JVS

[jgrapht-users] KShortest Path implementation

[Arun I. <aru...@ym...>]

Hi,
I am using JGraphT's KShortestPath implementation. In the code that I have, I have to create a new graph for every run and compute KShortestPath on it. I find that KShortestPath gives the right answers almost all the time, but sometimes, it doesn't give the right answers (on the same graph on which it gave the right answer before). I was wondering, why is this non-deterministic? Is there threading involved (either in graph creation or in k-shortestpath computation) ?

Regards,
Arun



      

Re: [jgrapht-users] Gaining access to verticies in an edge

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

http://www.jgrapht.org/javadoc/org/jgrapht/Graphs.html#neighborListOf(org.jgrapht.Graph,%20V)
http://www.jgrapht.org/javadoc/org/jgrapht/alg/NeighborIndex.html

JVS

blaze999 wrote:
> Hi,
> 
> I am working on a program to calculate the google normalised distance for
> verticies in a graph.
> I was just wondering in JgraphT if you have an edge is there anyway to get
> the list of neighbours for each of the nodes that make up the edge
> 
> e.g E=(2,3)
> 
> i need to get the list of neighbours for nodes 2 and 3. Also I need the
> neighbours that belong to both nodes 2 and 3. Is there any method in JgraphT
> that does that
> 
> Kind Regards

[jgrapht-users] Gaining access to verticies in an edge

[blaze999 <sa...@br...>]

Hi,

I am working on a program to calculate the google normalised distance for
verticies in a graph.
I was just wondering in JgraphT if you have an edge is there anyway to get
the list of neighbours for each of the nodes that make up the edge

e.g E=(2,3)

i need to get the list of neighbours for nodes 2 and 3. Also I need the
neighbours that belong to both nodes 2 and 3. Is there any method in JgraphT
that does that

Kind Regards
-- 
View this message in context: http://n3.nabble.com/Gaining-access-to-verticies-in-an-edge-tp464441p464441.html
Sent from the jgrapht-users mailing list archive at Nabble.com.

[jgrapht-users] Graph isomorphism

[Hans-Peter S. <str...@ep...>]

Hello,

can I and if so how check graph isomorphism with JGraphT?
Probably this question is already answered in the mailing list, but I 
couldn't find out how to search the archive.

Best regards
Hans 

Re: [jgrapht-users] Importing DOT

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

T. Andrew Lorenzen wrote:
> I noticed that there is a way to export graphs to DOT files. Is there a way to import those DOT files back into graphs?

No, so far no one has contributed an importer.  There are JavaCC and 
ANTLR grammars available for .dot, so it would be great if someone 
wanted to submit a good integration.

JVS

[jgrapht-users] Importing DOT

[T. A. L. <Tim...@wi...>]

I noticed that there is a way to export graphs to DOT files. Is there a way to import those DOT files back into graphs?

Re: [jgrapht-users] Check out jgrapht into eclipse?

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

Chris Lott wrote:
> Hi I'm interested in extending the DOTExporter class and
> thought I'd start by checking out the jgrapht project into
> my eclipse.  I se the build.properties file mentions
> .project and .classpath files, but I don't see those files
> in SVN.  Am I being unusually dense?  Please advise, thanks
> in advance.

http://pub.eigenbase.org/wiki/JGraphT:ContributorGuidelines#Eclipse_Setup

JVS

Re: [jgrapht-users] Distance of a vertex from a source

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

It's been a very long time ago I used jgrapht, but if I recall
correctly, dijkstra's shortest path algorithm is implemented in
jgrapht. Simply find the shortest path between two vertices, and
calculate the amount of edges in the path.

br,

Joris

On Tue, Mar 9, 2010 at 8:42 PM, stratio <st...@ho...> wrote:
>
> Hi all, I would like to know how i can calculate the distance (expressed in
> numbers of edges...) between two vertices with jgrapht?
> --
> View this message in context: http://n3.nabble.com/Distance-of-a-vertex-from-a-source-tp438087p438087.html
> Sent from the jgrapht-users mailing list archive at Nabble.com.
>
> ------------------------------------------------------------------------------
> Download Intel&#174; Parallel Studio Eval
> Try the new software tools for yourself. Speed compiling, find bugs
> proactively, and fine-tune applications for parallel performance.
> See why Intel Parallel Studio got high marks during beta.
> http://p.sf.net/sfu/intel-sw-dev
> _______________________________________________
> jgrapht-users mailing list
> jgr...@li...
> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
>

[jgrapht-users] Distance of a vertex from a source

[stratio <st...@ho...>]

Hi all, I would like to know how i can calculate the distance (expressed in
numbers of edges...) between two vertices with jgrapht?
-- 
View this message in context: http://n3.nabble.com/Distance-of-a-vertex-from-a-source-tp438087p438087.html
Sent from the jgrapht-users mailing list archive at Nabble.com.

Re: [jgrapht-users] Finding existing vertices in JGraphT

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

It might be possible to genericize this by creating a class KeyedGraph  
which takes another graph type as a generics parameter and extends  
that.  Then it could either use a listener or method overrides to  
maintain the map automatically.  I haven't played around with that,  
but if someone gets it working and wants to contribute it, that would  
be great; I have come across similar use cases in the past myself but  
always kept the map outside in some other builder class.

JVS

On Feb 28, 2010, at 2:41 AM, "Andrew Doble" <ad...@gm...> wrote:

> Hallo,
>
> I’m trying to read in a set of publically available data files that  
> contain data about the human immune system and load them into a mult 
> igraph structure. Each vertex and each edge need to have a number of 
>  attributes and I have represented them with a class specific to the 
>  problem at hand. However, the order of the data in the files is not 
>  under my control. I therefore need to be able to find previously cr 
> eated vertex objects that have been added to the multigraph so that  
> I can add new edges and vertices to them as I encounter them in the  
> data file.
>
> I could create a “shadow” Map that contains the vertices already  
> added to the multigraph and use this to find what has previously bee 
> n added. However, this strikes me as such a common scenario that I f 
> eel there should be something (that I’ve missed) in the JGpaphT pack 
> age that allows me to do this without setting up another data struct 
> ure.
>
> Can anybody help me further?
>
> Many Thanks
>
> Andrew
>
> -- 
> GMX DSL: Internet, Telefon und Entertainment für nur 19,99 EUR/mtl.!
> http://portal.gmx.net/de/go/dsl02
>
> --- 
> --- 
> --- 
> ---------------------------------------------------------------------
> Download Intel&#174; Parallel Studio Eval
> Try the new software tools for yourself. Speed compiling, find bugs
> proactively, and fine-tune applications for parallel performance.
> See why Intel Parallel Studio got high marks during beta.
> http://p.sf.net/sfu/intel-sw-dev
> _______________________________________________
> jgrapht-users mailing list
> jgr...@li...
> https://lists.sourceforge.net/lists/listinfo/jgrapht-users

Re: [jgrapht-users] Finding existing vertices in JGraphT

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

Andrew Doble wrote:
> I could create a “shadow” Map that contains the vertices already
> added to the multigraph and use this to find what has previously been
> added. However, this strikes me as such a common scenario that I feel
> there should be something (that I’ve missed) in the JGpaphT package
> that allows me to do this without setting up another data structure.

You'll need to create your own map; there's nothing in JGraphT that will 
help you here.

JVS

[jgrapht-users] Finding existing vertices in JGraphT

[Andrew D. <ad...@gm...>]

Hallo, 

I’m trying to read in a set of publically available data files that contain data about the human immune system and load them into a multigraph structure. Each vertex and each edge need to have a number of attributes and I have represented them with a class specific to the problem at hand. However, the order of the data in the files is not under my control. I therefore need to be able to find previously created vertex objects that have been added to the multigraph so that I can add new edges and vertices to them as I encounter them in the data file. 

I could create a “shadow” Map that contains the vertices already added to the multigraph and use this to find what has previously been added. However, this strikes me as such a common scenario that I feel there should be something (that I’ve missed) in the JGpaphT package that allows me to do this without setting up another data structure. 

Can anybody help me further?

Many Thanks 

Andrew 

-- 
GMX DSL: Internet, Telefon und Entertainment für nur 19,99 EUR/mtl.!
http://portal.gmx.net/de/go/dsl02

Re: [jgrapht-users] Contributing to JGraphT

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

I have committed Tom's implementation of Kruskal's MST to Subversion. 
Thanks Tom!

JVS

Tom Conerly wrote:
> Hey,
> 
> I'm interested in doing some contribution to JGraphT. Attached is a 
> patch adding Kruskal's minimum spanning tree algorithm. I'm not sure I 
> followed all of the guidelines correctly, but I think I did. Hopefully 
> you can use it!
> 
> Tom

Re: [jgrapht-users] graph cell Getchildren question

[Vanessa R. <van...@ho...>]

It doesn't matter which function i used to get the number of children of the cell, i always get count=1.
 		 	   		  
_________________________________________________________________
Hotmail: Free, trusted and rich email service.
http://clk.atdmt.com/GBL/go/201469228/direct/01/

Re: [jgrapht-users] graph cell Getchildren question

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

Vanessa Ruiz wrote:
>                     // I tried each of the following functions to get 
> the childcount, to not avail
>                     // can you help me fix it, please?
> 
>                     size=cell.getChildCount();
>                     size=jgraph.getModel().getChildCount(nn);
>                     size=m.getChildCount(cell);

cell.getChildren().size()?

http://www.jgraph.com/doc/jgraph/org/jgraph/graph/DefaultGraphCell.html

It seems like you should also be able to use the JGraphT method 
DirectedGraph.outDegreeOf(v), but for that you'd need to be able to map 
from cell to vertex, and currently this map is private inside of 
JGraphModelAdapter.  Seems like we need to add a public accessor which 
is the inverse of getVertexCell, but maybe there is already some other 
way to do the same thing?  I don't know JGraph very well, only JGraphT.

JVS

[jgrapht-users] graph cell Getchildren question

[Vanessa R. <van...@ho...>]

Hello everybody, 

 

   I would like to know how many children a selected cell has. I have implemented this in the onMouseClick event: 
 
               // Get Cell under Mousepointer
                int x = e.getX(), y = e.getY();
                DefaultGraphCell cell = (DefaultGraphCell) jgraph.getFirstCellForLocation(x, y); //Object
                Object nn=jgraph.getFirstCellForLocation(x, y);
                String lab = jgraph.convertValueToString(cell);// Print Cell Label
                int size=0;
                Node node= new Node();
                if (cell != null)
                {
                    GraphModel m = jgraph.getModel();
                    node=(Node)cell.getUserObject(); 
 
                    // I tried each of the following functions to get the childcount, to not avail
                    // can you help me fix it, please?

                    size=cell.getChildCount();
                    size=jgraph.getModel().getChildCount(nn);
                    size=m.getChildCount(cell);
                                        
                    Node aux=new Node();
                    for (int i = 0; i < size; i++)
                    {
                        // Fetch the Child of Vertex at Index i
                        Object child = jgAdapter.getChild(cell, i);
                        if (child instanceof Node)
                        {
                            aux=(Node)child;
                           if(node.expanded==true)
                               jgAdapter.remove();
                        }
                    } 
               } 
 
  I want to get the number of children that the selected node has and i want to have access to all of them. How can i do that?
thanks!

 		 	   		  
_________________________________________________________________
Hotmail: Powerful Free email with security by Microsoft.
http://clk.atdmt.com/GBL/go/201469230/direct/01/

Re: [jgrapht-users] Edge label questions

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

It looks like you adapted the code from here:

http://pub.eigenbase.org/wiki/JGraphT:LabeledEdges

But I don't think you adapted it correctly.

Vanessa Ruiz wrote:
> private static class ListenableDirectedMultigraph<V, MyEdge>
>             extends DefaultListenableGraph<V, MyEdge>
>         implements DirectedGraph<V, MyEdge>
>     {
>         private static final long serialVersionUID = 1L;
>         listenableDirectedMultigraph(class <MyEdge>(edgeClass))
>         {
>             super (new DirectedMultigraph<V, MyEdge>(new 
> ClassBasedEdgeFactory<V, RelationshipEdge>(RelationshipEdge.class));
>         }
>     }

Here you are still referring to RelationshipEdge instead of MyEdge. 
Also, your constructor starts with a lowercase l where it should be L to 
match the class name.  And I don't know what "class <MyEdge>" means.

Finally, it's not actually necessary to have the v1/v2 data members (in 
fact that duplicates storage from the DefaultEdge base class); that 
example wiki page needs to be updated.

JVS

[jgrapht-users] Edge label questions

[Vanessa R. <van...@ho...>]

Hi everybody,

I'm trying to learn how to use the jgrapht library, so I'm playing with the JGraphAdapterDemo.java and I added my new nodes, but i can't figure out how to play with the DefaultEdge class, to allow me to add or remove the labels on the edge.

 

// create a JGraphT graph
        ListenableGraph<String, DefaultEdge> g =
            new ListenableDirectedMultigraph<String, DefaultEdge>(
                DefaultEdge.class);

        // create a visualization using JGraph, via an adapter
        jgAdapter = new JGraphModelAdapter<String, DefaultEdge>(g);

        JGraph jgraph = new JGraph(jgAdapter);

        adjustDisplaySettings(jgraph);
        getContentPane().add(jgraph);
        resize(DEFAULT_SIZE);

        String v1 = "v1";
        String v2 = "v2";
        String v3 = "v3";
        String v4 = "v4";

        // add some sample data (graph manipulated via JGraphT)
        g.addVertex(v1);
        g.addVertex(v2);
        g.addVertex(v3);
        g.addVertex(v4);

        g.addEdge(v1, v2);
        g.addEdge(v2, v3);
        g.addEdge(v3, v1);
        g.addEdge(v4, v3);

        // position vertices nicely within JGraph component
        positionVertexAt(v1, 130, 40);
        positionVertexAt(v2, 60, 200);
        positionVertexAt(v3, 310, 230);
        positionVertexAt(v4, 380, 70); 

 

 private static class ListenableDirectedMultigraph<V, E>
        extends DefaultListenableGraph<V, E>
        implements DirectedGraph<V, E>
    {
        private static final long serialVersionUID = 1L;

        ListenableDirectedMultigraph(Class<E> edgeClass)
        {
            super(new DirectedMultigraph<V, E>(edgeClass));
        }
    } 

 

 I tried creating my own class that extends from DefaultEdge, but i don't know how to replace the DefaultEdge with my class in  the function: private static class ListenableDirectedMultigraph<V, MyEdge> . It gives me tons of errors.
        

public static class MyEdge<V> extends DefaultEdge
    {
        private V v1;
        private V v2;
        private String label;

        public MyEdge(V v1, V v2, String label)
        {
            this.v1 = v1;
            this.v2 = v2;
            this.label = label;
        }

        public V getV1()
        {
            return v1;
        }

        public V getV2()
        {
            return v2;
        }

        @Override
        public String toString()
        {
            return label;
        }
    }

 

private static class ListenableDirectedMultigraph<V, MyEdge>
            extends DefaultListenableGraph<V, MyEdge>
        implements DirectedGraph<V, MyEdge>
    {
        private static final long serialVersionUID = 1L;

        listenableDirectedMultigraph(class <MyEdge>(edgeClass))
        {
            super (new DirectedMultigraph<V, MyEdge>(new ClassBasedEdgeFactory<V, RelationshipEdge>(RelationshipEdge.class));
        }

    } 

 

 

thanks,
 		 	   		  
_________________________________________________________________
Hotmail: Trusted email with Microsoft’s powerful SPAM protection.
http://clk.atdmt.com/GBL/go/201469226/direct/01/

Re: [jgrapht-users] problem with random graph generation

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

Hmmm, based on the stack dump I requested when I reproduced your
infinite loop, here's what is happening:

- you're using a graph which does not allow self-loops
- you're using a vertex factory which always produces the same vertex
(empty string)
- hence you always have a self-loop due to non-distinct vertices
- the generator keeps generating the self-loops and tossing them as invalid
- the generator keeps going, hoping that it will eventually satisfy
your request for 5 edges, but never does

The fix is to supply a vertex factory which generates distinct
vertices.  Note that the existing unit tests in
testsrc/org/jgrapht/generate/RandomGraphGeneratorTest.java use
IntegerVertexFactory.

The generator could be made safer by having it check that it actually
generated the number of distinct vertices requested, and throwing an
exception if this is not the case (before going into the
edge-generation loop).

JVS

On Wed, Feb 10, 2010 at 7:20 AM, andrea pagani <pag...@gm...> wrote:
> Hi everybody,
>
> I'm trying to generate random graphs using the provided set of functions in
> JGrapht, actually the code im using is:
>
>
> /*************************************************************************************************************************************************************/
>
> RandomGraphGenerator<String, DefaultEdge> randomGenerator = new
> RandomGraphGenerator<String, DefaultEdge>(5, 5);
> Graph<String, DefaultEdge> randomGraph = new SimpleGraph<String,
> DefaultEdge>(DefaultEdge.class);
> VertexFactory<String> factory = new
> ClassBasedVertexFactory<String>(String.class);
> randomGenerator.generateGraph(randomGraph, factory, null);
>
> /***********************************************************************************************************************************************************/
>
> it's just an example creating a random graph with 5 nodes and 5 edges.
>
> the program get stuck when invoking
> "randomGenerator.generateGraph(randomGraph, factory, null);" any idea?
> I think I miss something with the factory...help is really appreciated!
>
> Thanks in advance.
>
>
> Best regards,
>
> Andrea
>
> ------------------------------------------------------------------------------
> SOLARIS 10 is the OS for Data Centers - provides features such as DTrace,
> Predictive Self Healing and Award Winning ZFS. Get Solaris 10 NOW
> http://p.sf.net/sfu/solaris-dev2dev
> _______________________________________________
> jgrapht-users mailing list
> jgr...@li...
> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
>
>