jgrapht-users — JGraphT user list.

Re: [jgrapht-users] serializing a graph

[Trevor H. <tr...@vo...>]

On Aug 10, 2007, at 5:45 PM, Tanton Gibbs wrote:

> Can anyone tell me if there exists
> code to create a graph that has been created via an exporter?

I believe the external format handlers are all export-only.

> Or, are any of the graph classes serializable?

As you can see from looking at the API documentation, the default  
graph classes implement Serializable. So, you can just serialize your  
graphs to the database as binary objects.

Trevor

[jgrapht-users] serializing a graph

[Tanton G. <tan...@gm...>]

I want to store my jgrapht graph in a database.  I was going to use an
exporter and store it in GraphML, GML, or DOT format (it doesn't
really matter the format).  However, I don't know how to create the
graph from the serialized format.  I can write the code to do it, but
I'd rather use someone else's :-)  Can anyone tell me if there exists
code to create a graph that has been created via an exporter?  Or, are
any of the graph classes serializable?

Thanks!
Tanton

Re: [jgrapht-users] RE : Re: RE : Some contributions

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

I have checked Guillaume's contributions (biconnectivity/cutpoint 
inspection; k-shortest-paths; masked subgraphs) into Subversion. 
They'll be released when JGraphT 0.7.2 goes out.

Guillaume, a few notes on changes I made as part of commit:

- I genericized some of the classes that needed it.  For future 
contributions, it's mandatory that they compile without warnings (for 
both functional code and unit tests).  I've got the ant compile to pass 
cleanly, but still need to work through Eclipse warnings in the unit 
tests (since I didn't propagate the generics there yet).

- In particular, clone doesn't work well with generics; I replaced that 
with a copy constructor pattern.

- I left out the heap utility code, since it's not used by any of the 
new classes, and we already have an existing heap implementation with 
equivalent functionality.  We can revisit this if there's a good reason 
to maintain multiple or replace.

- I moved ClassBasedVertexFactory to org.jgrapht.graph as a peer to 
ClassBasedEdgeFactory (you had it as unit test infrastructure).

- I renamed IMaskFunction to MaskFunctor to match naming conventions.

- I put the copyright as France Telecom to match what you requested for 
earlier contributions; let me know if that is no longer correct.

- I ran Jalopy to standardize formatting, and made a few other 
standardizations and removed the public modifier from some classes that 
should remain internal until they are ready for formal publication.  For 
future contributions, please add standard JGraphT file and class headers 
for all files.

- I deleted French-language comments (mostly in unit tests), because (a) 
the non-ASCII characters were giving javadoc warnings and (b) the rest 
of the library uses English.  My apologies for the cultural imperialism.

Thanks again for the great contributions; every one strengthens the library!

JVS

gu boulmi wrote:
>   Hi,
> 
>   Since last time, I've migrated to JGraphT v 0.7.
> So you will find enclosed almost the same constributions that I posted 
> few months ago but 0.7-compliant so that it could be added to next 
> release without any problem.
> I've added some JUnit tests and I've specified in the javadoc the 
> running time of the algorithms when possible.
> 
> Zip file includes among other things:
> - Element (vertex/edge) mask to allow to create a subgraph in O(1).
> - BiconnectivityInspector and BlockCutpointGraph
> - Algorithm for the K shortest paths
> 
> Any feedback is welcome.
> 
>   BR,
> 
>   Guillaume
> 
> N.B.: I've renamed the zip file with .zip2 extension so that the file 
> will not be blocked.
> 
> 
> */"John V. Sichi" <js...@gm...>/* a écrit :
> 
>     gu boulmi wrote:
>      > It seems that .zip extension is blocked. That's why I've renamed
>     the zip
>      > file with .zip2 extension and I retry to send my mail above.
> 
>     Thanks, got it. I'll respond as soon as I get some time.
> 
>     I notice that you're still referring to org._3pq.jgrapht; the package
>     got renamed to org.jgrapht as part of the 0.7.0 release. It would help
>     if all files sent were baselined against the subversion head, or at
>     least 0.7.0, since there have been many changes.
> 
>     JVS
> 
> 
> ------------------------------------------------------------------------
> Stockage illimité de vos mails avec Yahoo! Mail. Changez aujourd'hui de 
> mail ! <http://fr.promotions.yahoo.com/mail/nouveau_yahoomail2.html>

[jgrapht-users] Problem in displaying a Node using JGraph

[Surendran D <sur...@Te...>]

Hi All,

=20

I am developing a swing application that uses JGraph to display the
network topology.

=20

The problem is I couldn't figure out how to bring Switch and
Router(icon/gif files) display inside the JGraph. I am new to this
library...

=20

I am using..

=20

GraphPanel extends JGraph=20

=20

For creating vertex..

=20

DefaultGraphCell vertex =3D new DefaultGraphCell(name);

=20

=20

=20

=20

Thanks,

Surendran

=20

=20

=20

=20



=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D
=20
Disclaimer:

This message and the information contained herein is proprietary and=
 confidential and subject to the Tech Mahindra policy statement, you may=
 review the policy at <a href=
=3D"http://www.techmahindra.com/Disclaimer.html">http://www.techmahindra.co=
m/Disclaimer.html</a> externally and <a href=
=3D"http://tim.techmahindra.com/Disclaimer.html">http://tim.techmahindra.co=
m/Disclaimer.html</a> internally within Tech Mahindra.

=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D

[jgrapht-users] OT: Invitation to participate in research project

[Ben A. <ben...@st...>]

Hello there

I would greatly appreciate a small amount of your time to assist with
my doctoral research at The University of Newcastle. The research
concerns open source licensing and we're seeking developers working on
Java projects. The research is supervised, ethics-approved, anonymous
and results will be freely available. Participation will also provide a
custom licensing report for your project. To learn more, please visit:

   http://licensing-research.newcastle.edu.au

Thanks for reading this email, and I hope you'll consider participating.

Best regards
Ben Alex

(My apologies for being off-topic; this list will not be emailed again)

Re: [jgrapht-users] Directed Path Question

[Kyle L. <ky...@ar...>]

If there are two edges from A to B, then remove one.

If there is an edge from A to B, and a path of length n>1 from A to B
then remove the edge. (path does not have edge because lack of cycles in
graph).  This probably can be done with matrix operations:
1) Make adjacency matrix A(1)
2) Perform A(n+1)=(A(n)*A(n))+A(n) until fix point achieved*
3) Perform M=A(n)*A(1) to get reach on path lengths > 1
4) Remove edges from graph found in M

* Note "+" is cell-wise binary OR


Warning:  This is completely made up by a guy with rusty math skills. 
Be sure to verify algorithm.


Alexandros Marinos wrote:
> Hello JGraphT team,
>
> First of all, i'd like to congratulate you on the excelent work you
> have put
> in making this library a stable and useful piece of open source
> software. On
> to my problem:
>
> I'll start with my general problem, continue with the solution strategy i
> have followed so i can get to the specific problem i have encountered. If
> anyone knows of a solution/algorithm that i can apply at an earlier
> part of
> the process, that is welcome too.
>
> I am starting with an unweighted directed graph and I am attempting to
> find
> its Minimum Equivalent Graph. Essentially a MEG is a graph that has the
> minimum number of edges from the original graph but maintains the same
> connectivity properties. Things are not so difficult because my Graph is
> acyclical.
>
> My approach is to remove each edge and see if there is a path from
> source to
> destination vertex. Essentially i am checking to see if there is an
> alternative path. If there is no path, i add the edge back. I am not sure
> 100% if this is efficient theoretically but i think it will do for now
> untill a better solution comes up.
>
> However, pathExists does not work for directed paths as is stated in the
> documentation.
> So i am stuck without having a way of finding if there is a directed path
> that leads from one vertex to another. If there is no such algorithm
> implemented in the library i will have to implement one on my own,
> which i
> am trying to avoid. However, if there is no solution currently, i
> would be
> happy to write and contribute any relevant code that is required.
>
> So, if anyone has any ideas on how to solve either my general or my
> specific
> problem i would be happy to hear them. If there is no solution currently
> implemented, i would appreciate information on what would be the most
> proper
> place in the library to implement (either directedPathExists or
> findMinimumEquivalentGraph) and i can make an attempt on my own.
>
> Best,
> Alexandros.
>
> ------------------------------------------------------------------------
>
> -------------------------------------------------------------------------
> This SF.net email is sponsored by DB2 Express
> Download DB2 Express C - the FREE version of DB2 express and take
> control of your XML. No limits. Just data. Click to get it now.
> http://sourceforge.net/powerbar/db2/
> ------------------------------------------------------------------------
>
> _______________________________________________
> jgrapht-users mailing list
> jgr...@li...
> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
>   


-- 
----------------------------------------------------------------------
Kyle Lahnakoski                                       ky...@ar...
(416) 892-7784                                    Arcavia Software Ltd

Re: [jgrapht-users] Directed Path Question

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

For directedPathExists, you can use 
DijkstraShortestPath.findPathBetween, or DepthFirstIterator.

JVS

Alexandros Marinos wrote:
> Hello JGraphT team,
> 
> First of all, i'd like to congratulate you on the excelent work you have 
> put in making this library a stable and useful piece of open source 
> software. On to my problem:
> 
> I'll start with my general problem, continue with the solution strategy 
> i have followed so i can get to the specific problem i have encountered. 
> If anyone knows of a solution/algorithm that i can apply at an earlier 
> part of the process, that is welcome too.
> 
> I am starting with an unweighted directed graph and I am attempting to 
> find its Minimum Equivalent Graph. Essentially a MEG is a graph that has 
> the minimum number of edges from the original graph but maintains the 
> same connectivity properties. Things are not so difficult because my 
> Graph is acyclical.
> 
> My approach is to remove each edge and see if there is a path from 
> source to destination vertex. Essentially i am checking to see if there 
> is an alternative path. If there is no path, i add the edge back. I am 
> not sure 100% if this is efficient theoretically but i think it will do 
> for now untill a better solution comes up.
> 
> However, pathExists does not work for directed paths as is stated in the 
> documentation.
> So i am stuck without having a way of finding if there is a directed 
> path that leads from one vertex to another. If there is no such 
> algorithm implemented in the library i will have to implement one on my 
> own, which i am trying to avoid. However, if there is no solution 
> currently, i would be happy to write and contribute any relevant code 
> that is required.
> 
> So, if anyone has any ideas on how to solve either my general or my 
> specific problem i would be happy to hear them. If there is no solution 
> currently implemented, i would appreciate information on what would be 
> the most proper place in the library to implement (either 
> directedPathExists or findMinimumEquivalentGraph) and i can make an 
> attempt on my own.
> 
> Best,
> Alexandros.
> 
> 
> ------------------------------------------------------------------------
> 
> -------------------------------------------------------------------------
> This SF.net email is sponsored by DB2 Express
> Download DB2 Express C - the FREE version of DB2 express and take
> control of your XML. No limits. Just data. Click to get it now.
> http://sourceforge.net/powerbar/db2/
> 
> 
> ------------------------------------------------------------------------
> 
> _______________________________________________
> jgrapht-users mailing list
> jgr...@li...
> https://lists.sourceforge.net/lists/listinfo/jgrapht-users

[jgrapht-users] Directed Path Question

[Alexandros M. <al...@gm...>]

Hello JGraphT team,

First of all, i'd like to congratulate you on the excelent work you have put
in making this library a stable and useful piece of open source software. On
to my problem:

I'll start with my general problem, continue with the solution strategy i
have followed so i can get to the specific problem i have encountered. If
anyone knows of a solution/algorithm that i can apply at an earlier part of
the process, that is welcome too.

I am starting with an unweighted directed graph and I am attempting to find
its Minimum Equivalent Graph. Essentially a MEG is a graph that has the
minimum number of edges from the original graph but maintains the same
connectivity properties. Things are not so difficult because my Graph is
acyclical.

My approach is to remove each edge and see if there is a path from source to
destination vertex. Essentially i am checking to see if there is an
alternative path. If there is no path, i add the edge back. I am not sure
100% if this is efficient theoretically but i think it will do for now
untill a better solution comes up.

However, pathExists does not work for directed paths as is stated in the
documentation.
So i am stuck without having a way of finding if there is a directed path
that leads from one vertex to another. If there is no such algorithm
implemented in the library i will have to implement one on my own, which i
am trying to avoid. However, if there is no solution currently, i would be
happy to write and contribute any relevant code that is required.

So, if anyone has any ideas on how to solve either my general or my specific
problem i would be happy to hear them. If there is no solution currently
implemented, i would appreciate information on what would be the most proper
place in the library to implement (either directedPathExists or
findMinimumEquivalentGraph) and i can make an attempt on my own.

Best,
Alexandros.

Re: [jgrapht-users] Use more then one same or different Edges between two nodes

[Trevor H. <tr...@vo...>]

On Jun 17, 2007, at 1:17 PM, Stan Novogroudski wrote:

> Hi Trevor,
> thanks for your rapid answer, but it does not helped.
>
> I try to set costs of moving between two nodes. It must be possible to
> set one cost in one direction but another back. Thats works until all
> costs in graph are different. If I set same cost to another Edge, the
> second settled is ignored.
> I really do not understand, why another edges are ignored.
>
> Stan

You are using addEdge() incorrectly. Look at the API documentation  
carefully. The method takes an Edge object as its final parameter,  
not a weight. Remove the final parameter and you should find that all  
edges are added correctly.

If you want to set the weight of an edge, use  
WeightedGraph.setEdgeWeight().

Trevor

Re: [jgrapht-users] Use more then one same or different Edges between two nodes

[Trevor H. <tr...@vo...>]

On Jun 17, 2007, at 12:13 PM, Stan Novogroudski wrote:

> I trying to set more then one Edge between two nodes

Try using DirectedWeightedMultigraph.

Trevor

[jgrapht-users] Use more then one same or different Edges between two nodes

[Stan N. <dj-...@ar...>]

Hi, jgrapht users.

I trying to set more then one Edge between two nodes: my class:
. . . .


public class HarmoGraph {

    /** Creates a new instance of HarmoGraph */
    public HarmoGraph() {
        // create a graph based on strings
            DefaultDirectedWeightedGraph Graph = createGraph();
        System.out.println(Graph.toString());
	 }

    public DefaultDirectedWeightedGraph<String, Double> createGraph()
    {
        DefaultDirectedWeightedGraph<String, Double> g = new
DefaultDirectedWeightedGraph(DefaultEdge.class);

        String T = "T";
        String S = "S";
        String D = "D";
        String Tp = "Tp";
        String Dp = "Dp";
        String Sp = "Sp";
        String Dv = "Dv";
        String D7 = "D7";

        // add the vertices
        g.addVertex(T);
        g.addVertex(S);
        g.addVertex(D);
        g.addVertex(Tp);
        g.addVertex(Dp);
        g.addVertex(Sp);
        g.addVertex(Dv);
        g.addVertex(D7);
       // g.setEdgeWeight(e1, 10);


	//Hier setting Edges between Nodes
	//Another directions has an another Edge
	//between the same nodes.
	g.addEdge(D, T, 2.0);
        g.addEdge(T, S, 1.0);
        g.addEdge(S, T, 1.0);
        g.addEdge(S, D, 1.0);
        g.addEdge(D, S, 1.0);
        g.addEdge(T, D, 3.0);
        return g;

    }

}


//End Class.

I do not understand, why I become this output:
([T, S, D, Tp, Dp, Sp, Dv, D7], [2.0=(D,T), 1.0=(T,S), 3.0=(T,D)])

Where are my another Edges = 1.0 between (S, T), (S, D) and (D, S)?


Best regards and thanks a lot.
Stan

[jgrapht-users] Use more then one same or different Edges between two nodes

[Stan N. <st...@st...>]

Hi, jgrapht users.

I trying to set more then one Edge between two nodes: my class:
. . . .


public class HarmoGraph {

    /** Creates a new instance of HarmoGraph */
    public HarmoGraph() {
        // create a graph based on strings
            DefaultDirectedWeightedGraph Graph = createGraph();
        System.out.println(Graph.toString());
	 }

    public DefaultDirectedWeightedGraph<String, Double> createGraph()
    {
        DefaultDirectedWeightedGraph<String, Double> g = new
DefaultDirectedWeightedGraph(DefaultEdge.class);

        String T = "T";
        String S = "S";
        String D = "D";
        String Tp = "Tp";
        String Dp = "Dp";
        String Sp = "Sp";
        String Dv = "Dv";
        String D7 = "D7";

        // add the vertices
        g.addVertex(T);
        g.addVertex(S);
        g.addVertex(D);
        g.addVertex(Tp);
        g.addVertex(Dp);
        g.addVertex(Sp);
        g.addVertex(Dv);
        g.addVertex(D7);
       // g.setEdgeWeight(e1, 10);


	//Hier setting Edges between Nodes
	//Another directions has an another Edge
	//between the same nodes.
	g.addEdge(D, T, 2.0);
        g.addEdge(T, S, 1.0);
        g.addEdge(S, T, 1.0);
        g.addEdge(S, D, 1.0);
        g.addEdge(D, S, 1.0);
        g.addEdge(T, D, 3.0);
        return g;

    }

}


//End Class.

I do not understand, why I become this output:
([T, S, D, Tp, Dp, Sp, Dv, D7], [2.0=(D,T), 1.0=(T,S), 3.0=(T,D)])

Where are my another Edges = 1.0 between (S, T), (S, D) and (D, S)?


Best regards and thanks a lot.
Stan

Re: [jgrapht-users] [graphviz-interest] Subgraphs of subgraphs

[Trevor H. <tr...@vo...>]

On May 29, 2007, at 2:18 AM, pet...@ba...  
wrote:

> I used nested subgraphs (clusters) with good success. If this is,  
> what you
> want, just use:
>
> subgraph cluster_A {
>       label="Cluster A\n"
>       A_A -> A_B -> A_C
>
>       subgraph cluster_B {
>             label="Cluster B\n"
>             B_A -> B_B
>
>       }
> }

Ah, so that's how it works! I was trying to specify the clusters on  
the same scope and didn't even think about nesting them. Thanks for  
the tip!

Trevor

[jgrapht-users] transitive closure algorithm added

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

I've just checked this contribution from Vinayak Borkar into Subversion.

JVS

Re: [jgrapht-users] Query about scalability using JGraphT

[Lokeya V. <lo...@gm...>]

Thanks a lot for your reply.

This gives me really a good idea. I like to how whats the size of a
node/vertex in the 500,000 vertex graph which you have mentioned.
My project is related to information processing to be more specific query
processing with the option for user feedback where they can take the initial
graph and further ask for more relations among documents, so the graph will
grow.

I understand the fact that the ability to get the graph is more dependent on
the RAM but then I just want to make sure if I have really a good amount of
memory support, then JGraph doesn't have any issue with respect to number of
nodes/edges.

On 4/10/07, Aaron Harnly <jgr...@li...> wrote:
>
> Hi Lokeya,
>
> On Apr 10, 2007, at 8:06 PM, Lokeya Venkatachalam wrote:
> > I will do that testing and see. But I am just curious if anyone has
> > done this before.
>
> I've done lots of work with about 500,000 vertices, which is a bit
> ungainly but certainly tractable.
>
> > To be more precise, will it scale to represent 1 million document ,
> > where each document is 1KB in size which is around 1GB of data in
> > form of nodes.
>
> Unless you're actively using the content of the documents as you
> traverse the nodes (certainly a possibility), it would seem wise to
> me to keep the node objects very lightweight, referring to a backing
> store of files or database rows as necessary. In the project I
> referred to above, we chose the latter route, with the nodes
> initially containing just id numbers, and optionally caching values
> from the database as needed.
>
> hope that helps,
> Aaron
> --
> Aaron Harnly
> Center for Computational Learning Systems
> Columbia University
>
>
>
>

Re: [jgrapht-users] Query about scalability using JGraphT

[Randall R S. <rs...@so...>]

On Tuesday 10 April 2007 17:06, Lokeya Venkatachalam wrote:
> I will do that testing and see. But I am just curious if anyone has
> done this before.
> To be more precise, will it scale to represent 1 million document ,
> where each document is 1KB in size which is around 1GB of data in
> form of nodes.

The amount of internal storage associated with each node is not a factor 
in the performance of the JGraphT code. That concerns only the 
magnitude of the node and arc sets, the graph's topology and what 
operations you invoke.

32-bit Java Virtual Machines can comfortably manage 1 GB heaps. 
Naturally, you must have the full GB of physical RAM available for the 
JVM.


Randall Schulz

Re: [jgrapht-users] Query about scalability using JGraphT

[Aaron H. <jgr...@li...>]

Hi Lokeya,

On Apr 10, 2007, at 8:06 PM, Lokeya Venkatachalam wrote:
> I will do that testing and see. But I am just curious if anyone has  
> done this before.

I've done lots of work with about 500,000 vertices, which is a bit  
ungainly but certainly tractable.

> To be more precise, will it scale to represent 1 million document ,  
> where each document is 1KB in size which is around 1GB of data in  
> form of nodes.

Unless you're actively using the content of the documents as you  
traverse the nodes (certainly a possibility), it would seem wise to  
me to keep the node objects very lightweight, referring to a backing  
store of files or database rows as necessary. In the project I  
referred to above, we chose the latter route, with the nodes  
initially containing just id numbers, and optionally caching values  
from the database as needed.

hope that helps,
Aaron
--
Aaron Harnly
Center for Computational Learning Systems
Columbia University

Re: [jgrapht-users] Query about scalability using JGraphT

[Lokeya V. <lo...@gm...>]

I will do that testing and see. But I am just curious if anyone has done
this before.
To be more precise, will it scale to represent 1 million document , where
each document is 1KB in size which is around 1GB of data in form of nodes.

On 4/5/07, Trevor Harmon <tr...@vo...> wrote:
>
> On Apr 5, 2007, at 10:24 AM, Lokeya Venkatachalam wrote:
>
> > We are dealing with millions of documents. Each document is less
> > than 2KB size.
>
> How about generating a graph of millions of 2 KB vertices? (Use one
> of the classes in org.jgrapht.generate for this.) Then you can run
> some simple tests and see what kind of performance you get.
>
> Trevor
>
>

Re: [jgrapht-users] Query about scalability using JGraphT

[Trevor H. <tr...@vo...>]

On Apr 5, 2007, at 10:24 AM, Lokeya Venkatachalam wrote:

> We are dealing with millions of documents. Each document is less  
> than 2KB size.

How about generating a graph of millions of 2 KB vertices? (Use one  
of the classes in org.jgrapht.generate for this.) Then you can run  
some simple tests and see what kind of performance you get.

Trevor

Re: [jgrapht-users] Query about scalability using JGraphT

[Lokeya V. <lo...@gm...>]

We are dealing with millions of documents. Each document is less than 2KB
size.

On 4/3/07, Trevor Harmon <tr...@vo...> wrote:
>
> On Apr 2, 2007, at 8:26 PM, Lokeya Venkatachalam wrote:
>
> > I am doing a project in information retrieval where I deal with
> > huge collection of documents.
>
> How huge is huge?
>
> > So is JGraph scalable for such case?
>
> It depends on what operations you're doing. I haven't done any tests,
> but I'm sure JGraphT is as a scalable as any other Java-based graph
> library.
>
> Trevor
>
>

Re: [jgrapht-users] Query about scalability using JGraphT

[Trevor H. <tr...@vo...>]

On Apr 2, 2007, at 8:26 PM, Lokeya Venkatachalam wrote:

> I am doing a project in information retrieval where I deal with  
> huge collection of documents.

How huge is huge?

> So is JGraph scalable for such case?

It depends on what operations you're doing. I haven't done any tests,  
but I'm sure JGraphT is as a scalable as any other Java-based graph  
library.

Trevor

[jgrapht-users] Query about scalability using JGraphT

[Lokeya V. <lo...@gm...>]

Hi,

I am looking at using an appropriate Java Graph library to use for my
project. I am doing a project in information retrieval where I deal with
huge collection of documents. I will be representing the document groups as
nodes and use edges to connect these. My Graph will keep growing as I will
be trying to find get more connections among documents. So is JGraph
scalable for such case?

Kindly let me know.

Re: [jgrapht-users] Neighbourhood of a vertex

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

http://www.jgrapht.org/javadoc/org/jgrapht/traverse/ClosestFirstIterator.html#ClosestFirstIterator(org.jgrapht.Graph,%20V,%20double)

JVS

Nico Las wrote:
> Hi,
> 
> Here's my problem:
> I would like to extract a subgraph (or a list of vertices) comprised
> of all vertices within a distance N from a given vertex.
> 
> Is it directly possible?
> Or do I have to call neighborListOf(Graph<V,E> g, V vertex) N times?
> 
> Thanks.
> Nicolas
> 
> -------------------------------------------------------------------------
> Take Surveys. Earn Cash. Influence the Future of IT
> Join SourceForge.net's Techsay panel and you'll get the chance to share your
> opinions on IT & business topics through brief surveys-and earn cash
> http://www.techsay.com/default.php?page=join.php&p=sourceforge&CID=DEVDEV
> _______________________________________________
> jgrapht-users mailing list
> jgr...@li...
> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
> 

[jgrapht-users] Neighbourhood of a vertex

[Nico L. <j....@gm...>]

Hi,

Here's my problem:
I would like to extract a subgraph (or a list of vertices) comprised
of all vertices within a distance N from a given vertex.

Is it directly possible?
Or do I have to call neighborListOf(Graph<V,E> g, V vertex) N times?

Thanks.
Nicolas

[jgrapht-users] Neighbourhood of a vertex

[Nicolas G. <nic...@gm...>]

Hi,

Here's my problem:
I would like to extract a subgraph (or a list of vertices) comprised
of all vertices within a distance N from a given vertex.

Is it directly possible?
Or do I have to call neighborListOf(Graph<V,E> g, V vertex) N times?

Thanks.
Nicolas