jgrapht-users — JGraphT user list.

[jgrapht-users] bug report

[mhmd m. el h. <mhm...@ho...>]

there is a problem with this codeprivate void positionVertexAt( Object vertex, int x, int y ) {
        DefaultGraphCell cell = m_jgAdapter.getVertexCell( vertex );
        Map              attr = cell.getAttributes(  );
        Rectangle        b    = GraphConstants.getBounds( attr );

        GraphConstants.setBounds( attr, new Rectangle( x, y, b.width, b.height ) );

        Map cellAttr = new HashMap(  );
        cellAttr.put( cell, attr );
        m_jgAdapter.edit( cellAttr, null, null, null, null );
    }
problem with  Rectangle object and the parameters for  m_jgAdapter.edit

mhmd Mohtadi el-...@st...
http://http://www.facebook.com/mohtadi.hajj
70 x53305
 		 	   		  

[jgrapht-users] IOException while Serializing a JgraphT object

[giskard89 <gis...@gm...>]

Heya, I'm writing a simple applet where a graph will be handled. Code is VERY
SIMILAR to JGraphAdapterDemo class. Actually, it IS that example, just
modified a bit.
Also, I've added Serializable implementation to as much parents as
possibile, such as:
1- ListenableDirectedGraph
2- DefaultListenableGraph
3- GraphDelegator
And serialized interfaces used too, like
1b- JGraphModelAdapter
2b- DefaultGraphModel
And I think the problem (IOException) comes from here, 1b or 2b.

So, befor showing you the code, my question is:
- does anyone know how to save a graph object in a similar way,
  or is there some other method to do this ?

Thank you for your patience, but I guess this question would interest not
few of you fellows.
__________________________________________________________________________________________
public class JGraphAdapterDemo extends JApplet {

    *//MY OWN CODE* for save/load, works fine I'm sure
    private FileObject loadSaveHandler;   

    private ListenableDirectedGraph<String, DefaultEdge> g;

    private JGraphModelAdapter<String, DefaultEdge> jgAdapter;

    public void init()
    {
    	loadSaveHandler = new FileObject("dummyfile.sav");
    	
         g = new ListenableDirectedGraph<String, DefaultEdge>
(DefaultEdge.class);

        *// WITHOUT THIS*, and subsequent instructions, saving "g" has no
problems
        jgAdapter = new JGraphModelAdapter<String, DefaultEdge> ( g );
        JGraph jgraph = new JGraph(jgAdapter);
        //end of subsequent istructions

        String v1 = "v1";
        g.addVertex(v1);

        positionVertexAt(v1, 130, 40);

        loadSaveHandler.SaveObject(g);
        *//HERE I CATCH IOEXCEPTION*
    }

    private void positionVertexAt(Object vertex, int x, int y)
    {
        DefaultGraphCell cell = jgAdapter.getVertexCell(vertex);
        AttributeMap attr = cell.getAttributes();
        Rectangle2D bounds = GraphConstants.getBounds(attr);

        Rectangle2D newBounds =
            new Rectangle2D.Double( x, y, bounds.getWidth(),
bounds.getHeight() );

        GraphConstants.setBounds(attr, newBounds);

        AttributeMap cellAttr = new AttributeMap();
        cellAttr.put(cell, attr);
        jgAdapter.edit(cellAttr, null, null, null);
    }

} // End JGraphAdapterDemo.java

--
View this message in context: http://jgrapht-users.107614.n3.nabble.com/IOException-while-Serializing-a-JgraphT-object-tp3785792p3785792.html
Sent from the jgrapht-users mailing list archive at Nabble.com.

Re: [jgrapht-users] Creating a directed graph from xml documents

[giskard89 <gis...@gm...>]

Yeah, I need it too. I think the common problem is: jgrapht allows you to
export a graph in a GraphML format, but there isn't its complementary
module: the import.

Hope they'll write it soon!

--
View this message in context: http://jgrapht-users.107614.n3.nabble.com/Creating-a-directed-graph-from-xml-documents-tp3782735p3784640.html
Sent from the jgrapht-users mailing list archive at Nabble.com.

[jgrapht-users] Creating a directed graph from xml documents

[bhargavibbv <bha...@gm...>]

I need to create a directed graph by considering elements or few attributes
of xml document as vertices and parent-child relationships and interlinks as
edges of the directed graph using jgrapht library. Are there any XML
specific classes or classes that take document as input in jgrapht
library?...
Thanks ....

--
View this message in context: http://jgrapht-users.107614.n3.nabble.com/Creating-a-directed-graph-from-xml-documents-tp3782735p3782735.html
Sent from the jgrapht-users mailing list archive at Nabble.com.

Re: [jgrapht-users] should DirectedGraphUnion have a public constructor or a factory method ?

[Sal C. <sal...@gm...>]

Great!

Thanks,

Sal
On Feb 18, 2012, at 12:43 AM, John Sichi wrote:

> Good point...I'll fix that for the next release.
> 
> JVS
> 
> On Fri, Feb 17, 2012 at 10:54 PM, Sal Cobian <sal...@gm...> wrote:
>> The visibility of the constructors is at the package level.
>> Thoughts ?
>> 
>> Thanks,
>> 
>> 
>> Sal
>> 
>> 
>> 
>> 
>> public class DirectedGraphUnion<V, E>
>>     extends GraphUnion<V, E, DirectedGraph<V, E>>
>>     implements DirectedGraph<V, E>
>> {
>>     //~ Static fields/initializers
>> ---------------------------------------------
>> 
>>     private static final long serialVersionUID = -740199233080172450L;
>> 
>>     //~ Constructors
>> -----------------------------------------------------------
>> 
>>     DirectedGraphUnion(
>>         DirectedGraph<V, E> g1,
>>         DirectedGraph<V, E> g2,
>>         WeightCombiner operator)
>>     {
>>         super(g1, g2, operator);
>>     }
>> 
>>     DirectedGraphUnion(DirectedGraph<V, E> g1, DirectedGraph<V, E> g2)
>>     {
>>         super(g1, g2);
>>     }
>> 
>>     //~ Methods
>> ----------------------------------------------------------------
>> 
>>     public int inDegreeOf(V vertex)
>>     {
>>         Set<E> res = incomingEdgesOf(vertex);
>>         return res.size();
>>     }
>> 
>>     public Set<E> incomingEdgesOf(V vertex)
>>     {
>>         Set<E> res = new HashSet<E>();
>>         if (getG1().containsVertex(vertex)) {
>>             res.addAll(getG1().incomingEdgesOf(vertex));
>>         }
>>         if (getG2().containsVertex(vertex)) {
>>             res.addAll(getG2().incomingEdgesOf(vertex));
>>         }
>>         return Collections.unmodifiableSet(res);
>>     }
>> 
>>     public int outDegreeOf(V vertex)
>>     {
>>         Set<E> res = outgoingEdgesOf(vertex);
>>         return res.size();
>>     }
>> 
>>     public Set<E> outgoingEdgesOf(V vertex)
>>     {
>>         Set<E> res = new HashSet<E>();
>>         if (getG1().containsVertex(vertex)) {
>>             res.addAll(getG1().outgoingEdgesOf(vertex));
>>         }
>>         if (getG2().containsVertex(vertex)) {
>>             res.addAll(getG2().outgoingEdgesOf(vertex));
>>         }
>>         return Collections.unmodifiableSet(res);
>>     }
>> }
>> 
>> ------------------------------------------------------------------------------
>> Virtualization & Cloud Management Using Capacity Planning
>> Cloud computing makes use of virtualization - but cloud computing
>> also focuses on allowing computing to be delivered as a service.
>> http://www.accelacomm.com/jaw/sfnl/114/51521223/
>> _______________________________________________
>> jgrapht-users mailing list
>> jgr...@li...
>> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
>> 

Re: [jgrapht-users] should DirectedGraphUnion have a public constructor or a factory method ?

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

Good point...I'll fix that for the next release.

JVS

On Fri, Feb 17, 2012 at 10:54 PM, Sal Cobian <sal...@gm...> wrote:
> The visibility of the constructors is at the package level.
> Thoughts ?
>
> Thanks,
>
>
> Sal
>
>
>
>
> public class DirectedGraphUnion<V, E>
>     extends GraphUnion<V, E, DirectedGraph<V, E>>
>     implements DirectedGraph<V, E>
> {
>     //~ Static fields/initializers
> ---------------------------------------------
>
>     private static final long serialVersionUID = -740199233080172450L;
>
>     //~ Constructors
> -----------------------------------------------------------
>
>     DirectedGraphUnion(
>         DirectedGraph<V, E> g1,
>         DirectedGraph<V, E> g2,
>         WeightCombiner operator)
>     {
>         super(g1, g2, operator);
>     }
>
>     DirectedGraphUnion(DirectedGraph<V, E> g1, DirectedGraph<V, E> g2)
>     {
>         super(g1, g2);
>     }
>
>     //~ Methods
> ----------------------------------------------------------------
>
>     public int inDegreeOf(V vertex)
>     {
>         Set<E> res = incomingEdgesOf(vertex);
>         return res.size();
>     }
>
>     public Set<E> incomingEdgesOf(V vertex)
>     {
>         Set<E> res = new HashSet<E>();
>         if (getG1().containsVertex(vertex)) {
>             res.addAll(getG1().incomingEdgesOf(vertex));
>         }
>         if (getG2().containsVertex(vertex)) {
>             res.addAll(getG2().incomingEdgesOf(vertex));
>         }
>         return Collections.unmodifiableSet(res);
>     }
>
>     public int outDegreeOf(V vertex)
>     {
>         Set<E> res = outgoingEdgesOf(vertex);
>         return res.size();
>     }
>
>     public Set<E> outgoingEdgesOf(V vertex)
>     {
>         Set<E> res = new HashSet<E>();
>         if (getG1().containsVertex(vertex)) {
>             res.addAll(getG1().outgoingEdgesOf(vertex));
>         }
>         if (getG2().containsVertex(vertex)) {
>             res.addAll(getG2().outgoingEdgesOf(vertex));
>         }
>         return Collections.unmodifiableSet(res);
>     }
> }
>
> ------------------------------------------------------------------------------
> Virtualization & Cloud Management Using Capacity Planning
> Cloud computing makes use of virtualization - but cloud computing
> also focuses on allowing computing to be delivered as a service.
> http://www.accelacomm.com/jaw/sfnl/114/51521223/
> _______________________________________________
> jgrapht-users mailing list
> jgr...@li...
> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
>

[jgrapht-users] should DirectedGraphUnion have a public constructor or a factory method ?

[Sal C. <sal...@gm...>]

The visibility of the constructors is at the package level.
Thoughts ?

Thanks,


Sal




public class DirectedGraphUnion<V, E>
    extends GraphUnion<V, E, DirectedGraph<V, E>>
    implements DirectedGraph<V, E>
{
    //~ Static fields/initializers ---------------------------------------------

    private static final long serialVersionUID = -740199233080172450L;

    //~ Constructors -----------------------------------------------------------

    DirectedGraphUnion(
        DirectedGraph<V, E> g1,
        DirectedGraph<V, E> g2,
        WeightCombiner operator)
    {
        super(g1, g2, operator);
    }

    DirectedGraphUnion(DirectedGraph<V, E> g1, DirectedGraph<V, E> g2)
    {
        super(g1, g2);
    }

    //~ Methods ----------------------------------------------------------------

    public int inDegreeOf(V vertex)
    {
        Set<E> res = incomingEdgesOf(vertex);
        return res.size();
    }

    public Set<E> incomingEdgesOf(V vertex)
    {
        Set<E> res = new HashSet<E>();
        if (getG1().containsVertex(vertex)) {
            res.addAll(getG1().incomingEdgesOf(vertex));
        }
        if (getG2().containsVertex(vertex)) {
            res.addAll(getG2().incomingEdgesOf(vertex));
        }
        return Collections.unmodifiableSet(res);
    }

    public int outDegreeOf(V vertex)
    {
        Set<E> res = outgoingEdgesOf(vertex);
        return res.size();
    }

    public Set<E> outgoingEdgesOf(V vertex)
    {
        Set<E> res = new HashSet<E>();
        if (getG1().containsVertex(vertex)) {
            res.addAll(getG1().outgoingEdgesOf(vertex));
        }
        if (getG2().containsVertex(vertex)) {
            res.addAll(getG2().outgoingEdgesOf(vertex));
        }
        return Collections.unmodifiableSet(res);
    }
}

[jgrapht-users] should DirectedGraphUnion have a public constructor or a factory method ?

[Sal C. <sal...@gm...>]

The visibility of the constructors is at the package level.
Thoughts ?

Thanks,


Sal




public class DirectedGraphUnion<V, E>
    extends GraphUnion<V, E, DirectedGraph<V, E>>
    implements DirectedGraph<V, E>
{
    //~ Static fields/initializers ---------------------------------------------

    private static final long serialVersionUID = -740199233080172450L;

    //~ Constructors -----------------------------------------------------------

    DirectedGraphUnion(
        DirectedGraph<V, E> g1,
        DirectedGraph<V, E> g2,
        WeightCombiner operator)
    {
        super(g1, g2, operator);
    }

    DirectedGraphUnion(DirectedGraph<V, E> g1, DirectedGraph<V, E> g2)
    {
        super(g1, g2);
    }

    //~ Methods ----------------------------------------------------------------

    public int inDegreeOf(V vertex)
    {
        Set<E> res = incomingEdgesOf(vertex);
        return res.size();
    }

    public Set<E> incomingEdgesOf(V vertex)
    {
        Set<E> res = new HashSet<E>();
        if (getG1().containsVertex(vertex)) {
            res.addAll(getG1().incomingEdgesOf(vertex));
        }
        if (getG2().containsVertex(vertex)) {
            res.addAll(getG2().incomingEdgesOf(vertex));
        }
        return Collections.unmodifiableSet(res);
    }

    public int outDegreeOf(V vertex)
    {
        Set<E> res = outgoingEdgesOf(vertex);
        return res.size();
    }

    public Set<E> outgoingEdgesOf(V vertex)
    {
        Set<E> res = new HashSet<E>();
        if (getG1().containsVertex(vertex)) {
            res.addAll(getG1().outgoingEdgesOf(vertex));
        }
        if (getG2().containsVertex(vertex)) {
            res.addAll(getG2().outgoingEdgesOf(vertex));
        }
        return Collections.unmodifiableSet(res);
    }
}

Re: [jgrapht-users] Question re type of license

[Yael K. <Ya...@me...>]

Dear Sir/Madam,

I understand that the Jgrapht software is licensed under GNU LGPL. My questions is if such software is licensed under v 2.1 or also under V.3.

I would appreciate your prompt respond to this email.



Yael Kalman, Adv.
Meitar Liquornik Geva & Leshem Brandwein, Law Offices
16 Abba Hillel Rd. Ramat Gan 52506, Israel
Tel - 972-3-6103100 Fax - 972-3-6103684
http://www.meitar.com<blocked::http://www.meitar.com/>

********************************************************
This email message and any attachments thereto are subject to attorney - client privilege and is intended only for use by the addressee(s) named above. If you are not the intended addressee, you are hereby kindly notified that any dissemination, distribution or copying of this email and any attachments thereto is strictly prohibited. If you have received this email in error, kindly delete it from your computer system and notify us at the telephone number or email address appearing above. Thank you.
P Please consider the environment before printing this email

Re: [jgrapht-users] Traversing graph from the exit node

[<hnr...@gr...>]

Hi Sira,

sounds like org.jgrapht.graph.EdgeReversedGraph is what you are looking for. If it isn't, then please give some more details on what you're trying to do.

Regards,
   Ernst

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

----- Reply message -----
From: "Sira ASTOUR" <sa...@sc...>
To: <jgr...@li...>
Subject: [jgrapht-users] Traversing graph from the exit node
Date: Wed, Feb 1, 2012 23:46
I am trying to traverse a graph from the exit node … for my
work I would prefer to use the BreadthFirstIteraor … any help?

Re: [jgrapht-users] Two questions about JGrapht

[<hnr...@gr...>]

Hello Fatih,

1. I don't think there's a random DAG generator in jgrapht. There's RandomGraphGenerator and ScaleFreeGraphGenerator. You could use one of these and manipulate the result by breaking or directing cycles or you could create your own generator. In any case there are many different notions on what a "random" graph precisely is.

2. I don't understand the question:-( First, for undirected graphs, strongly connected is the same thing as connected. Second, if the graph consist of only one component, what other components would you like to be returned? Can you give an example?

Regards,
   Ernst

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

----- Reply message -----
From: ftu...@4c...
To: <jgr...@li...>
Subject: [jgrapht-users] Two questions about JGrapht
Date: Thu, Feb 2, 2012 18:46


Hi,

I just started using JGrapht and am getting familiar with the details.I
have two questions and I would be happy if you could share your ideas
about them.

1. I would like to randomly generate a DAG. I checked RandomGraphGenerator
class to see if it does what I want but it seems like, it generates
totally random topologies. Is it possible to generate a DAG randomly? 2. I
have an undirected graph and I am interested to get all strongly connected
components of that graph. There is the class
StrongConnectivityInspector that provides the necessary functionality with
nice methods such as stronglyConnectedSubgraphs(). However, it seems like
(if I am not making a mistake) this method returns the maximum strongly
connected component (i.e. just one) if my input graph is itself a strongly
connected graph. Is there a way of getting all possible components?

Thanks in advance.

-
Fatih






------------------------------------------------------------------------------
Keep Your Developer Skills Current with LearnDevNow!
The most comprehensive online learning library for Microsoft developers
is just $99.99! Visual Studio, SharePoint, SQL - plus HTML5, CSS3, MVC3,
Metro Style Apps, more. Free future releases when you subscribe now!
http://p.sf.net/sfu/learndevnow-d2d
_______________________________________________
jgrapht-users mailing list
jgr...@li...
https://lists.sourceforge.net/lists/listinfo/jgrapht-users

[jgrapht-users] Two questions about JGrapht

[<ftu...@4c...>]

Hi,

I just started using JGrapht and am getting familiar with the details.I
have two questions and I would be happy if you could share your ideas
about them.

1. I would like to randomly generate a DAG. I checked RandomGraphGenerator
class to see if it does what I want but it seems like, it generates
totally random topologies. Is it possible to generate a DAG randomly? 2. I
have an undirected graph and I am interested to get all strongly connected
components of that graph. There is the class
StrongConnectivityInspector that provides the necessary functionality with
nice methods such as stronglyConnectedSubgraphs(). However, it seems like
(if I am not making a mistake) this method returns the maximum strongly
connected component (i.e. just one) if my input graph is itself a strongly
connected graph. Is there a way of getting all possible components?

Thanks in advance.

-
Fatih

[jgrapht-users] Two questions about JGrapht

[<ftu...@4c...>]

Hi,

I just started using JGrapht and am getting familiar with the details.I
have two questions and I would be happy if you could share your ideas
about them.

1. I would like to randomly generate a DAG. I checked RandomGraphGenerator
class to see if it does what I want but it seems like, it generates
totally random topologies. Is it possible to generate a DAG randomly?
2. I have an undirected graph and I am interested to get all strongly
connected components of that graph. There is the class
StrongConnectivityInspector that provides the necessary functionality with
nice methods such as stronglyConnectedSubgraphs(). However, it seems like
(if I am not making a mistake) this method returns the maximum strongly
connected component (i.e. just one) if my input graph is itself a strongly
connected graph. Is there a way of getting all possible components?

Thanks in advance.

-
Fatih

[jgrapht-users] Traversing graph from the exit node

[Sira A. <sa...@sc...>]

I am trying to traverse a graph from the exit node . for my work I would
prefer to use the BreadthFirstIteraor . any help?

[jgrapht-users] (no subject)

[Sira A. <sa...@sc...>]

sa...@sc...

Re: [jgrapht-users] JGraphT Version 0.8.3 Released

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

Oops, I sent out the wrong wiki link for the release notes again.
Here's the correct one:

https://sourceforge.net/apps/mediawiki/jgrapht/index.php?title=jgrapht:Release0.8.3

On Thu, Jan 19, 2012 at 11:53 PM, John Sichi <js...@gm...> wrote:
> This release includes a number of bugfixes and contributions which
> have accumulated since the 0.8.2 release. You can find a description
> of the changes here:
>
> http://jgrapht.wikispaces.com/Release0.8.3
>
> Jars are still not available in Maven Central Repository.  I could
> really use some help with this and other maintenance, so I've created
> a page describing the state of the project:
>
> https://sourceforge.net/apps/mediawiki/jgrapht/index.php?title=jgrapht:AdoptAHighway
>
> If you want to at least show your moral support, please like this Facebook Page:
>
> https://www.facebook.com/jgrapht.adopt.a.highway
>
> :)
>
> As always, a hearty thanks to all who made suggestions and code
> contributions for this release.
>
> JVS

[jgrapht-users] JGraphT Version 0.8.3 Released

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

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

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

Jars are still not available in Maven Central Repository.  I could
really use some help with this and other maintenance, so I've created
a page describing the state of the project:

https://sourceforge.net/apps/mediawiki/jgrapht/index.php?title=jgrapht:AdoptAHighway

If you want to at least show your moral support, please like this Facebook Page:

https://www.facebook.com/jgrapht.adopt.a.highway

:)

As always, a hearty thanks to all who made suggestions and code
contributions for this release.

JVS

Re: [jgrapht-users] Use of JGraphT with existing graph implementation

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

Sun, Jan 15, 2012 at 1:13 PM, Ichiro Furusato <ich...@gm...> wrote:
> I've already got my own graph database interface (with three
> implementations), and I'm interested in using JGraphT to obtain its
> structural and traversal algorithms/functionality -- rather than
> writing my own.
>
> Are there any examples of using JGraphT with an existing graph implementation?

After browsing around for a while, I found this example:

https://github.com/trickl/trickl-graph/blob/master/src/main/java/com/trickl/graph/planar/DoublyConnectedEdgeList.java

JVS

[jgrapht-users] Use of JGraphT with existing graph implementation

[Ichiro F. <ich...@gm...>]

Hi,

My apologies if this is an RTFM question, I've looked through the
archives but couldn't find an answer.

I've already got my own graph database interface (with three
implementations), and I'm interested in using JGraphT to obtain its
structural and traversal algorithms/functionality -- rather than
writing my own.

Are there any examples of using JGraphT with an existing graph implementation?

Thanks very much for any pointers,

Ichiro

[jgrapht-users] Problems with DOTExporter

[gutineli <gut...@gm...>]

Hi,

Please could you help me figure out why I'm getting NullPointerException
with this code:

DOTExporter<State, Action> exporter = 
        new DOTExporter<State, Action>(new IntegerNameProvider<State(),
	null, new EdgeNameProvider&lt;Action>() {

	@Override
	public String getEdgeName(Action act) {
		return act.toString();
	}		
});
exporter.export(new PrintWriter(new PrintWriter(new
FileWriter("test.dot"))), mdp);

This gives:
Exception in thread "main" java.lang.NullPointerException
	at org.jgrapht.ext.DOTExporter.renderAttributes(Unknown Source)
	at org.jgrapht.ext.DOTExporter.export(Unknown Source)

I'm using version 1.6 of JGraphT.

Thank you!
Eli

--
View this message in context: http://jgrapht-users.107614.n3.nabble.com/Problems-with-DOTExporter-tp3648938p3648938.html
Sent from the jgrapht-users mailing list archive at Nabble.com.

[jgrapht-users] Heap Out of Memory issues on large system

[Benjamin B. <ba...@ia...>]

List,

I'm using JGraphT in an implementation of the Shared Nearest Neighbor
clustering algorithm with a large number of nodes (O(100K)) with each
node having O(10) edges.  I'm running on a RH machine with a 64-bit
JVM and 48GB of memory, with the arguments:

-Xms10m -Xmx47G -Dnio.ms=10Mb -Dnio.mx=47Gb

But am still getting OOM errors when adding the later edges.  Granted
this graph is large - but I have trouble believing it can't fit in
47GB of RAM.  I've tried to get more detail using jvisualvm - but the
program takes over 24 hours to reach the point of memory exhaustion,
by which point I'm inevitably not watching the console when it dies.
Dumping the heap on OOM works when enabled from within jvisualvm, but
I don't have enough disk space to store it (quota issues).

Am I doing something wrong, or is there an alternate way of using
JGraphtT for large graphs?  Should I be trying to use a DB backend
instead of RAM for the graph (quota issues aside)?  Is that even
possible?

Thanks!
-Ben

[jgrapht-users] HamiltonianCycle

[<dex...@ti...>]

Hi,
I'm using the function
HamiltonianCycle.getApproximateOptimalForCompleteGraph() on my
SimpleWeightedGraph but I don't have an optimal minimal solution.
I have a greedy solution.
How must I do to have an hamiltonian cycle minimum?

[jgrapht-users] Using HamiltonianCycle

[<dex...@ti...>]

Hi,
I want to have a minimum hamiltonian cycle from a simple weighted graph
complete.
I don't know how to set the initial node to start,
Can you help me?

Re: [jgrapht-users] saving to database

[Anup J. <arj...@gm...>]

Ben:
thanks for your answer. But my question concerns saving a JGrapht graph
entity to the database and later retrieving it from the database  and
parsing it to a JGraphT graph again.
thanks


On Tue, Nov 22, 2011 at 6:40 PM, Ben Johnson <
bjo...@gm...> wrote:

>  You could take a look here:
> http://www.codeproject.com/KB/database/Modeling_DAGs_on_SQL_DBs.aspx
>
> I've played around persisting graphs to a NoSQL DB - CouchDB (
> http://couchdb.apache.org/) using Ektorp (http://www.ektorp.org/), which
> works fine.
>
>
> On 22/11/2011 11:57 PM, Anup Joshi wrote:
>
> Hello:
>
> I am a newbie to jgrapht ( primarily evaluating it for my purpose).
> I would like to know how I can store an in-memory graph representation to
> a mysql database and alternatively retrieve it and
> re-construct the graph in memory,
>
> Any help would be appreciated.
>
>
>
>
> ------------------------------------------------------------------------------
> All the data continuously generated in your IT infrastructure
> contains a definitive record of customers, application performance,
> security threats, fraudulent activity, and more. Splunk takes this
> data and makes sense of it. IT sense. And common sense.http://p.sf.net/sfu/splunk-novd2d
>
>
>
> _______________________________________________
> jgrapht-users mailing lis...@li...https://lists.sourceforge.net/lists/listinfo/jgrapht-users
>
>
>
> ------------------------------------------------------------------------------
> All the data continuously generated in your IT infrastructure
> contains a definitive record of customers, application performance,
> security threats, fraudulent activity, and more. Splunk takes this
> data and makes sense of it. IT sense. And common sense.
> http://p.sf.net/sfu/splunk-novd2d
> _______________________________________________
> jgrapht-users mailing list
> jgr...@li...
> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
>
>

Re: [jgrapht-users] saving to database

[Ben J. <bjo...@gm...>]

You could take a look here: 
http://www.codeproject.com/KB/database/Modeling_DAGs_on_SQL_DBs.aspx

I've played around persisting graphs to a NoSQL DB - CouchDB 
(http://couchdb.apache.org/) using Ektorp (http://www.ektorp.org/), 
which works fine.

On 22/11/2011 11:57 PM, Anup Joshi wrote:
> Hello:
>
> I am a newbie to jgrapht ( primarily evaluating it for my purpose).
> I would like to know how I can store an in-memory graph representation 
> to a mysql database and alternatively retrieve it and
> re-construct the graph in memory,
>
> Any help would be appreciated.
>
>
>
>
> ------------------------------------------------------------------------------
> All the data continuously generated in your IT infrastructure
> contains a definitive record of customers, application performance,
> security threats, fraudulent activity, and more. Splunk takes this
> data and makes sense of it. IT sense. And common sense.
> http://p.sf.net/sfu/splunk-novd2d
>
>
> _______________________________________________
> jgrapht-users mailing list
> jgr...@li...
> https://lists.sourceforge.net/lists/listinfo/jgrapht-users