jgrapht-users — JGraphT user list.

[jgrapht-users] What Layout Algorithm to use for visualize Internet nodes connectivities ?

[Xinuo C. <mac...@gm...>]

Hi all

Anyone has any ideas about What Layout Algorithm to use for visualize
Internet nodes connections?

I have more than 1,000 nodes, and they have various connections with each
other, i.e. they are clustered to some parts.

I wanna show the whole landscape of the nodes and their connections, which
Layout Algorithm is good for it?

Thanks

Xinuo

[jgrapht-users] Auto-Layout and JGraphAddons

[Xinuo C. <xin...@gm...>]

HI all.

I am new to JGraphT and JGraph.

I am wondering the way to automatically place all vertexes onto the graph
without manually give them positions. like if I have two thousand nodes to
place onto the graph, it is not possible for me to manually place them.

I searched the forum and found that this problem is related to layout thing
and layout needs JGraphAddons. But I can't find it in jgraph.com. 

Anyone could help me out of this? some hints on how to place vertexes onto
graph? how to find JGraphAddons?

By the way, I am using JGraph to draw many network nodes and show their
connections on the graph.

Thank you.

Xinuo

[jgrapht-users] breaking interface changes made/planned for 0.7

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

FYI:

http://sourceforge.net/forum/message.php?msg_id=3718040

JVS

Re: [jgrapht-users] General question about JGraph / JGraphT

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

I think your statement below is missing some T's, so it's hard to say 
whether it's correct or not.

Waxing dualistic:  the JGraphT object is the spirit, the JGraph object 
is the body, Swing is the material world, and the JGraphModelAdapter 
object is the pineal gland (what Descartes believed to be the connection).

If you want to do everything in the realm of abstract mathematical graph 
theory, all you need is JGraphT.  If you just want to render graph 
structures, all you need is JGraph.  If you want to do both at once 
(e.g. visualize the strongly connected components of a graph), you need 
a JGraphModelAdapter.

JVS

Naiara S. Pinto wrote:
> Dear all,
> 
> I have a general question about drawing graphs from JGraphT: When do you
> need a JGraphModelAdapter object, and when do you need a JGraph object?
> I suspect the adapter is used whenever we are passing a JGraph object to a
> method from the JGraph library and the JGraph object is used when we need
> an instance method from JGraph. Is this correct?
> 
> Thanks,
> 
> Naiara.
> 
> 
> -------------------------------------------------------
> Using Tomcat but need to do more? Need to support web services, security?
> Get stuff done quickly with pre-integrated technology to make your job easier
> Download IBM WebSphere Application Server v.1.0.1 based on Apache Geronimo
> http://sel.as-us.falkag.net/sel?cmd=k&kid0709&bid&3057&dat1642
> _______________________________________________
> jgrapht-users mailing list
> jgr...@li...
> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
> 

[jgrapht-users] General question about JGraph / JGraphT

[Naiara S. P. <na...@ma...>]

Dear all,

I have a general question about drawing graphs from JGraphT: When do you
need a JGraphModelAdapter object, and when do you need a JGraph object?
I suspect the adapter is used whenever we are passing a JGraph object to =
a
method from the JGraph library and the JGraph object is used when we need
an instance method from JGraph. Is this correct?

Thanks,

Naiara.

[jgrapht-users] JGraphT Subversion migration complete

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

All file version history was migrated as well, so the CVS repository has 
been disabled.  Anyone who had commit access to CVS has been given 
commit access to SVN now.  As part of the migration, I also took care of 
renaming package org._3pq.jgrapht to org.jgrapht (per enhancement 
request #1381861).

Here's how to get the code (assuming you've installed the command-line 
svn tool).  First, you probably want to rename your current sandbox 
(e.g. to jgrapht.cvs) so you can start fresh.  Then, from the parent 
directory where you want to create the jgrapht directory:

svn co https://svn.sourceforge.net/svnroot/jgrapht/trunk jgrapht

You may need to tell it to accept an SSL certificate permanently.  Be 
sure to use the full URL (the sf.net abbreviation didn't work when I 
tried it).

When committing for the first time, I had to update my credentials, 
probably because I started in a clean directory.

JVS

Re: [jgrapht-users] Can I achieve this via JGrapht?

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

JGraphT has a matrix exporter but not yet an importer.  For
visualization, use JGraph instead (or graphviz).

JVS

Vikrama Sanjeeva wrote:
> Hi,
> 
> I'm wondering if I could achieve the following task via JGrapht or it 
> could help me in task accomplishment?
> 
> Ok here is the task which is quite new and challenging for me!
> 
> 
> 1) The user will input a square matrix in a text file. It will be an 
> Adjacency Matrix.
> 2) Java program will read this text file and will validate whether the 
> input matrix is square or not? If yes then continue; else error screen.
> 3) After successfull validation, it will create a graph based on the 
> values of matrix.
> 4) The created (generated) graph (image) will be displayed as an output 
> to the user on his browser.
> 
> The business logic here is the method of creating graph based on matrix 
> values. This method I know well on paper-pencil. But implementing the 
> same in Java code and generating the graph is bit new. The later part, 
> i.e. generating the graph is in fact the actual task.
> 
> I've developed an explained example with matrix (input) and the 
> generated graph (output) here:
> http://www.uploadfile.info/uploads/457e277a37.jpg
> 
> In the graph, you will see objects are linked with each other via 
> arrows. This linking is decided on the matrix values. Most probably, I 
> will be having images of objets saved in my harddisk. Only Linking them 
> @ runtime have to be done.
> 
> Looking forward for the help!
> 
> Bye,
> Viki.

[jgrapht-users] Can I achieve this via JGrapht?

[Vikrama S. <vik...@gm...>]

Hi,

I'm wondering if I could achieve the following task via JGrapht or it could
help me in task accomplishment?

Ok here is the task which is quite new and challenging for me!


1) The user will input a square matrix in a text file. It will be an
Adjacency Matrix.
2) Java program will read this text file and will validate whether the inpu=
t
matrix is square or not? If yes then continue; else error screen.
3) After successfull validation, it will create a graph based on the values
of matrix.
4) The created (generated) graph (image) will be displayed as an output to
the user on his browser.

The business logic here is the method of creating graph based on matrix
values. This method I know well on paper-pencil. But implementing the same
in Java code and generating the graph is bit new. The later part, i.e.
generating the graph is in fact the actual task.

I've developed an explained example with matrix (input) and the generated
graph (output) here:
http://www.uploadfile.info/uploads/457e277a37.jpg

In the graph, you will see objects are linked with each other via arrows.
This linking is decided on the matrix values. Most probably, I will be
having images of objets saved in my harddisk. Only Linking them @ runtime
have to be done.

Looking forward for the help!

Bye,
Viki.

Re: [jgrapht-users] Labeled Edges.

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

Since this question keeps coming up, I just now deleted 
LabeledElement.java from CVS.  It was just causing confusion.

See my comments on Feature Request #1426276 for how I think this should 
be addressed by the new generics support:

http://sourceforge.net/tracker/index.php?func=detail&aid=1426276&group_id=86459&atid=579690

JVS

Valentin Ruano wrote:
> Hi all,
> 
> I'm new using JGraphT. I need to be able to hang arbitrary information 
> from vertex and edges. As vertex can be of any class that is not much 
> trouble. For edges is another story as it requires to create you own 
> edge class, factory and also graph implementation/interface that accept 
> labels (at least at edge addition). 
> 
> are there any thoughts about incorporating Labeled(Edge)Graphs in the 
> near future, or perhaps in the Java 1.5 generic version? I may 
> contribute my (future) code if not.
> 
> What is the function of jgrapht.LabeledElement interface? seems that is 
> not  referenced from anywhere.
> 
> cheers, Valentin.
> 

RE: [jgrapht-users] Labeled Edges.

[Welson S. <wel...@ya...>]

You are right, no code in the JGraphT is implementing LabeledElement
interface.
 
I have asked this question before, and I ended up just create my own edge
class which extends DirectedEdge.
 
I do agree that a generic LabeledEdge is needed.
 
 
Welson

  _____  

From: jgr...@li...
[mailto:jgr...@li...] On Behalf Of Valentin
Ruano
Sent: Monday, February 06, 2006 10:39 AM
To: jgr...@li...
Subject: [jgrapht-users] Labeled Edges.


Hi all,

I'm new using JGraphT. I need to be able to hang arbitrary information from
vertex and edges. As vertex can be of any class that is not much trouble.
For edges is another story as it requires to create you own edge class,
factory and also graph implementation/interface that accept labels (at least
at edge addition).  

are there any thoughts about incorporating Labeled(Edge)Graphs in the near
future, or perhaps in the Java 1.5 generic version? I may contribute my
(future) code if not.

What is the function of jgrapht.LabeledElement interface? seems that is not
referenced from anywhere.

cheers, Valentin.

[jgrapht-users] Labeled Edges.

[Valentin R. <val...@gm...>]

Hi all,

I'm new using JGraphT. I need to be able to hang arbitrary information from
vertex and edges. As vertex can be of any class that is not much trouble.
For edges is another story as it requires to create you own edge class,
factory and also graph implementation/interface that accept labels (at leas=
t
at edge addition).

are there any thoughts about incorporating Labeled(Edge)Graphs in the near
future, or perhaps in the Java 1.5 generic version? I may contribute my
(future) code if not.

What is the function of jgrapht.LabeledElement interface? seems that is not
referenced from anywhere.

cheers, Valentin.

[jgrapht-users] [Fwd: JGraphT contribution : Bellman-Ford algorithm]

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

Guilluame Boulmi has contributed an implementation of the Bellman-Ford
shortest-path algorithm, so if you've got a directed graph with negative
edge weights, this is your lucky day.  

(Guillaume, I'm guessing your surname from your email address; if it's
incorrect, please let me know.  Also, do you have a sourceforge account,
and do you want CVS write access to jgrapht?)

I committed Guillaume's code into CVS after adding support for generics
and making a few changes to make it more similar to the existing
DijkstraShortestPath class.  However, the two still have some interface
differences, so next I will take a look at Guillaume's enhanced Dijkstra
code and see if it can be integrated.

I also added some unit tests.  I removed some French comments because
javac was complaining about them in UTF8, and my translation attempts
would have been worse than no comments at all :)

JVS

-------- Forwarded Message --------
> From: gu boulmi <bou...@ya...>
> To: js...@gm...
> Subject: JGraphT contribution : Bellman-Ford algorithm
> Date: Thu, 5 Jan 2006 11:42:10 +0100 (CET)
> 
>   Hi and happy new year,
> 
>   Please find attached the Bellman-Ford algorithm I
> have written using JGraphT objects. It could close the
> feature request 846561 I think.
> 
>   I have also written a new class for Dijkstra
> algorithm with dedicated DijkstraIterator.
> 
>   The iterator was designed such that it that could be
> subclassed in case the seen-vertex-container change or
> in case path-cost-computation changed (e.g. with
> vertex weights taken into account) or in case not all
> outgoing-edges should be looped over (we could decide
> some edges should not be part of the returned paths).
> 
>   Furthermore paths are not represented as edge-lists
> but as a linked-list of path-element, similar to the
> sub-optimality property of shortest paths.
> 
>   Although I have not used Java generics, I hope it
> could be included in the next release 0.7.
> 
>   Best regards,
> 
>   Guillaume
> 
> 
> 	
> 	
> 		
> ___________________________________________________________________________ 
> Nouveau : téléphonez moins cher avec Yahoo! Messenger. Appelez le monde entier à partir de 0,012 €/minute ! 
> Téléchargez sur http://fr.messenger.yahoo.com

[jgrapht-users] Ellipse view of Vertex

[farhan a. <far...@ya...>]

Hi,
  I am newbie to JGrapht and want small example using JGraphT in which it shows me vertex in elliptical shape not always in Rectangular shape?
  Thanks in Advance
   


Farhan Afsar
M.Sc. Software Technology
HFT, Stuttgart
mobile: 0176-24169896
home-zone: 0711-1846580
		
---------------------------------
Yahoo! Photos – Showcase holiday pictures in hardcover
 Photo Books. You design it and we’ll bind it!

Re: [jgrapht-users] shortest path passing through

[Michael B. <beh...@in...>]

Am Sonntag, 8. Januar 2006 17:11 schrieb Xavier Noria:
> I would like to compute the shortest path between A and C passing
> through B. As far as I can tell that is the shortest path between A
> and B joined with the shortest path between B and C.
>
> Is there a known especific algorithm to compute that (albeit maybe
> not in the current API)? Or should I just build it from two calls to
> findPathBetween following the former remark? Efficiency is important
> in this application.

You could simply use the ClosestFirstIterator, starting from B and iterate =
the=20
vertices until you find A and C. This will work only for an undirected grap=
h=20
where the shortest path from A to B is equal to the shortest path from B to=
=20
A. Furthermore joining two paths does not neccessarily create a path=20
(depending on your definition of path) because vertices and edges may be=20
used multiple times. But if Your "path" is allowed to do so you can=20
reconstruct the two paths the same way it is done in=20
DijkstraShortestPath.createEdgeList.

Yours,
Michael

P.S: If performance is really critical and you do not need the full power o=
f=20
java collections strongly consider reimplementing it.
=2D-=20
Michael Behrisch (Tel. +49 30 2093-3123)
HU Berlin, Institut fuer Informatik, Arbeitsgruppe Algorithmen
http://www.informatik.hu-berlin.de/~behrisch/

[jgrapht-users] shortest path passing through

[Xavier N. <fx...@ha...>]

I would like to compute the shortest path between A and C passing  
through B. As far as I can tell that is the shortest path between A  
and B joined with the shortest path between B and C.

Is there a known especific algorithm to compute that (albeit maybe  
not in the current API)? Or should I just build it from two calls to  
findPathBetween following the former remark? Efficiency is important  
in this application.

-- fxn

[jgrapht-users] changing JGraphModelAdapter attributMap per vertex

[DIMAS K I R <syu...@in...>]

hi.

does anyone know how to change attributMap per vertices in
JGraphModelAdapter? (i'm using JGraph for visualisizing)

i have tried this line of code, but it didn't works..
it returned java.lang.NullPointerException

/////////////////////

//create attribut map method
public Map createTriggerVertexAttributeMap(){
        Map map =3D new Hashtable();
        // Make sure the cell is resized on insert
        GraphConstants.setResize(map, true);
        // Add a nice looking gradient background
        GraphConstants.setGradientColor(map, Color.red);
        // Add a Border Color Attribute to the Map
        GraphConstants.setBorderColor(map, Color.BLUE);
        // Add a White Background
        GraphConstants.setBackground(map, Color.yellow);
        // Make Vertex Opaque
        GraphConstants.setOpaque(map, true);
        GraphConstants.setBorder(map,new javax.swing.border.BevelBorder(0=
));
        GraphConstants.setAutoSize(map,true);
        GraphConstants.setIcon(map, new
ImageIcon(getClass().getResource("/img/dbRootDiagrams.GIF")));
        return map;
    }

//graphUtama is ListenableDirectedWeightedGraph
JGraphModelAdapter JGraphModel =3D new JGraphModelAdapter(graphUtama);
jgraph =3D new JGraph( JGraphModel );
JGraphModel.createDefaultEdgeAttributes(graphUtama);
JGraphModel.createDefaultVertexAttributes();

String inserted =3D new String("test");
graphUtama.addVertex(inserted);
jgraph.getModel().getAttributes(inserted).applyMap(createTriggerVertexAtt=
ributeMap());

/////////////////////////

thx before

Re: [jgrapht-users] How to add a "label" to an edge?

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

Hi Welson,

It seems LabeledElement never really got implemented, so for now its
presence is just confusing.

If you want to add a label to an edge, all you need to do is write your
own edge class (probably subclassing one of the existing ones such as
DirectedEdge) and add whatever attributes you want there.  And supply a
corresponding edge factory to your graph.

JVS

Welson Sun wrote:
> Hi,
> 
> I see this LabeledElement interface in JGraphT, but it seems that neither
> the vertex nor the edge in JGraphT implements the LabeledElement interface?
> 
> For the vertex, this may not be a problem, since the vertex can be an
> "Object". But what if I want to assign a "label" or an "Object" to an edge?
> 
> 
> Welson
> 
> 
> 
> 
> -------------------------------------------------------
> SF.Net email is Sponsored by the Better Software Conference & EXPO
> September 19-22, 2005 * San Francisco, CA * Development Lifecycle Practices
> Agile & Plan-Driven Development * Managing Projects & Teams * Testing & QA
> Security * Process Improvement & Measurement * http://www.sqe.com/bsce5sf
> _______________________________________________
> jgrapht-users mailing list
> jgr...@li...
> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
> 

[jgrapht-users] How to add a "label" to an edge?

[Welson S. <wel...@ya...>]

Hi,

I see this LabeledElement interface in JGraphT, but it seems that neither
the vertex nor the edge in JGraphT implements the LabeledElement interface?

For the vertex, this may not be a problem, since the vertex can be an
"Object". But what if I want to assign a "label" or an "Object" to an edge?


Welson

Re: [jgrapht-users] Auto-Layout and size?

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

Yes, JGraph has these capabilities (in the addons package), so if you 
use the JGraphModelAdapter to make JGraph and JGraphT work together, you 
can auto-layout your visualization.  Here's some example code (assuming 
you already have the model, view, and adapter tied together):

void layout(
     ListenableDirectedGraph graphModel,
     JGraphModelAdapter graphAdapter,
     JGraph graph)
{
     List roots = new ArrayList();
     Iterator vertexIter = graphModel.vertexSet().iterator();
     while (vertexIter.hasNext()) {
         Object vertex = vertexIter.next();
         if (graphModel.inDegreeOf(vertex) == 0) {
             roots.add(graphAdapter.getVertexCell(vertex));
         }
     }

     JGraphLayoutAlgorithm layout = new SugiyamaLayoutAlgorithm();
     layout.applyLayout(graph, layout, roots.toArray(), null);
}

JVS

Sven Abels wrote:
> Hi,
> 
> I would like to use JGraphT for a representation of our network and I would
> like to visualize the graph. However: I don't know in advance the number of
> vertex entries. Is it possible to use a "autosize" function to automatically
> set the size and the possition of the nodes in the graph visualization?
> 
> Best greetings,
> 
> Sven
> 
> 
> 
> -------------------------------------------------------
> SF.Net email is Sponsored by the Better Software Conference & EXPO
> September 19-22, 2005 * San Francisco, CA * Development Lifecycle Practices
> Agile & Plan-Driven Development * Managing Projects & Teams * Testing & QA
> Security * Process Improvement & Measurement * http://www.sqe.com/bsce5sf
> _______________________________________________
> jgrapht-users mailing list
> jgr...@li...
> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
> 

[jgrapht-users] Auto-Layout and size?

[Sven A. <Ne...@ab...>]

Hi,

I would like to use JGraphT for a representation of our network and I would
like to visualize the graph. However: I don't know in advance the number of
vertex entries. Is it possible to use a "autosize" function to automatically
set the size and the possition of the nodes in the graph visualization?

Best greetings,

Sven

Re: [jgrapht-users] Re: APSP problem.

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

Hi Richard,

Please add your code "as is" via the Feature Request System:

http://sourceforge.net/tracker/?atid=579690&group_id=86459&func=browse

Then eventually someone who needs it can convert and incorporate it into 
JGraphT.

Thanks,
JVS

Richard Adams wrote:
> Hi,
> I have a basic implementation of the   Floyd Warshall algorithm. On a 
> 9000 node graph all pairs are calculated
> in ~ 36h using a 4Ghz / 4Gb memoerySun cluster. You are welcome to it 
> but it is entirely independent of jgrapht,
> I am only an infrequent jgrapht user so would need some help in 
> converting it. You are welcome to it as is.
> The algorithm stores distances in a byte [][] - so e.g., a 9000 node 
> graph needs an 81Mb array.
> 
> It is much faster than running DjisktraSP repeatedly - I have access to 
> a parallel computing cluster and even running
> DSP on 8 threads is not faster than FW.
> Regards
> Richard
> 
> jgr...@li... wrote:
> 
>> Send jgrapht-users mailing list submissions to
>>     jgr...@li...
>>
>> To subscribe or unsubscribe via the World Wide Web, visit
>>     https://lists.sourceforge.net/lists/listinfo/jgrapht-users
>> or, via email, send a message with subject or body 'help' to
>>     jgr...@li...
>>
>> You can reach the person managing the list at
>>     jgr...@li...
>>
>> When replying, please edit your Subject line so it is more specific
>> than "Re: Contents of jgrapht-users digest..."
>>
>>
>> Today's Topics:
>>
>>   1. List of all Diskstra's distance from a given source to all points
>>       in the graph (Julien Thomas de Boer)
>>   2. Re: List of all Diskstra's distance from a given
>>       source to all points in the graph (John V. Sichi)
>>
>> --__--__--
>>
>> Message: 1
>> From: Julien Thomas de Boer <jul...@ep...>
>> To: jgr...@li...
>> Date: Tue, 02 Aug 2005 13:40:33 +0200
>> Subject: [jgrapht-users] List of all Diskstra's distance from a given 
>> source to all points
>> in the graph
>>
>> Hi everyone,
>> I want to compute the mean distance in a Jgrapht graph. So, I have to
>> compute distances for each possible pairs in the graph. But computing
>> Dijsktra for each pairs is taking too much time. I heard that Dijkstra 
>> didnt give you only  the shortest path between the source node
>> and the target node but also between the source and all nodes in the
>> graph at the same time. is it the case in the current implementation of
>> dijkstra in Jgraht? If yes, how can I retrieve this list of distances.
>> Thanks for your help.
>>
>>
>>  
>>
> 

[jgrapht-users] Re: APSP problem.

[Richard A. <Ric...@ed...>]

Hi,
I have a basic implementation of the   Floyd Warshall algorithm. On a 
9000 node graph all pairs are calculated
in ~ 36h using a 4Ghz / 4Gb memoerySun cluster. You are welcome to it 
but it is entirely independent of jgrapht,
I am only an infrequent jgrapht user so would need some help in 
converting it. You are welcome to it as is.
The algorithm stores distances in a byte [][] - so e.g., a 9000 node 
graph needs an 81Mb array.

It is much faster than running DjisktraSP repeatedly - I have access to 
a parallel computing cluster and even running
DSP on 8 threads is not faster than FW.
Regards
Richard

jgr...@li... wrote:

>Send jgrapht-users mailing list submissions to
>	jgr...@li...
>
>To subscribe or unsubscribe via the World Wide Web, visit
>	https://lists.sourceforge.net/lists/listinfo/jgrapht-users
>or, via email, send a message with subject or body 'help' to
>	jgr...@li...
>
>You can reach the person managing the list at
>	jgr...@li...
>
>When replying, please edit your Subject line so it is more specific
>than "Re: Contents of jgrapht-users digest..."
>
>
>Today's Topics:
>
>   1. List of all Diskstra's distance from a given source to all points
>       in the graph (Julien Thomas de Boer)
>   2. Re: List of all Diskstra's distance from a given
>       source to all points in the graph (John V. Sichi)
>
>--__--__--
>
>Message: 1
>From: Julien Thomas de Boer <jul...@ep...>
>To: jgr...@li...
>Date: Tue, 02 Aug 2005 13:40:33 +0200
>Subject: [jgrapht-users] List of all Diskstra's distance from a given source to all points
> in the graph
>
>Hi everyone,
>I want to compute the mean distance in a Jgrapht graph. So, I have to
>compute distances for each possible pairs in the graph. But computing
>Dijsktra for each pairs is taking too much time. I heard that 
>Dijkstra didnt give you only  the shortest path between the source node
>and the target node but also between the source and all nodes in the
>graph at the same time. is it the case in the current implementation of
>dijkstra in Jgraht? If yes, how can I retrieve this list of distances.
>Thanks for your help.
>
>
>  
>

-- 
Dr Richard Adams
Psychiatric Genetics Group,
Medical Genetics,
Molecular Medicine Centre,
Western General Hospital,
Crewe Rd West,
Edinburgh UK
EH4 2XU

Tel: 44 131 651 1084
ric...@ed...

Re: [jgrapht-users] List of all Diskstra's distance from a given source to all points in the graph

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

Based on another email from you, I think you already figured this out, 
but for the record, here's how you can do it for one start vertex:

1.  Create an instance of ClosestFirstIterator with your desired start 
vertex.

2.  Call next() on it until hasNext() returns false.

3.  For each vertex reached, use the iterator's getShortestPathLength 
method to get the information stored during iteration.

JGraphT doesn't currently have an all-pairs-shortest-path 
implementation.  If you implement one, please consider contributing it.

http://www.cs.rochester.edu/u/leblanc/csc173/graphs/apsp.html

JVS

Julien Thomas de Boer wrote:
> Hi everyone,
> I want to compute the mean distance in a Jgrapht graph. So, I have to
> compute distances for each possible pairs in the graph. But computing
> Dijsktra for each pairs is taking too much time. I heard that 
> Dijkstra didnt give you only  the shortest path between the source node
> and the target node but also between the source and all nodes in the
> graph at the same time. is it the case in the current implementation of
> dijkstra in Jgraht? If yes, how can I retrieve this list of distances.
> Thanks for your help.
> 
> 

[jgrapht-users] List of all Diskstra's distance from a given source to all points in the graph

[Julien T. de B. <jul...@ep...>]

Hi everyone,
I want to compute the mean distance in a Jgrapht graph. So, I have to
compute distances for each possible pairs in the graph. But computing
Dijsktra for each pairs is taking too much time. I heard that 
Dijkstra didnt give you only  the shortest path between the source node
and the target node but also between the source and all nodes in the
graph at the same time. is it the case in the current implementation of
dijkstra in Jgraht? If yes, how can I retrieve this list of distances.
Thanks for your help.


-- 
Sincerely,

Julien THOMAS DE BOER
Swiss Federal Institute of Technology of Lausanne (EPFL)

[jgrapht-users] Re: [jgrapht-developers] JGraphT backport

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

In line with Barak's suggestions below, I made the following changes:

- Instead of customBuild.properties, build.xml now reads 
etc/build.properties (if it exists).

- I created file etc/build.properties.template with the documented (but 
commented-out) property definitions in CVS.  In a distribution, this 
becomes etc/build.properties.  The reason I gave it a different name in 
CVS is to avoid developers accidentally editing it and committing 
site-specific changes.  Instead, developers should copy the template to 
etc/build.properties and edit that.  Distribution users can just edit 
etc/build.properties directly.

- I renamed the property from retro.jre.dir to jre1.4.dir

In addition, I also made a change to the jar naming convention.  The jar 
name used to be based on the release version, but I have found this to 
be a pain in dependent projects, because it means with every upgrade I 
have to edit the dependent build file to reference the new version. 
Instead, the jar names are now:

jgrapht-jdk1.4.jar (retrowoven version)
jgrapht-jdk1.5.jar (standard compile)

README.html explains when to use one or the other or both depending on 
your compile/deploy dependencies.

JVS

Barak Naveh wrote:
> Come to think of it, maybe it would be useful to extend the idea and instead
> of having 'customBuild.properties', we can have 'build.properties'.  Such a
> file might help with all kinds of custom of builds (release, cvstag,...),
> present and future.
> 
> The build.properties could have the form of commented sections, one section
> for each alternative build (one for retro).  When someone wants to build a
> retro, he just uncomments the params in the retro section and fills in the
> paths according to the documented instruction within the 'build.properties'
> itself.  In such a way, custom builds can be a no-brainer.  Of course, the
> file in its distributed form contains only comments, so that a casual "ant
> all" on the distribution doesn't do funny things...
> 
> 
> A little naming suggestion:
> 
> 
>>retro.jre.dir=/path/to/jre1.4
> 
> 
> Since the only JREs supported here are 1.4*, I think a variable name such as
> 'jre1_4.dir' or 'jre1.4.dir' will be more self-explanatory. 
> 
> Barak 
> 
> 
> 
>>-----Original Message-----
>>
>>The JGraphT development version (0.7.0alpha) in CVS requires JDK 1.5 to
>>build, but I've just checked in backport support to allow it to run on
>>JRE 1.4.  To use it, install Retroweaver (and JRE 1.4), then create a
>>file named customBuild.properties in the same directory as build.xml and
>>add these two lines:
>>
>>retroweaver.dir=/path/to/full/distribution/of/retroweaver
>>retro.jre.dir=/path/to/jre1.4
>>
>>Then run ant.  The "all" target will perform a normal build/test/jar
>>sequence, and then run the backport (overwriting the class files in
>>place with their retrowoven versions).  Then it will re-run all tests
>>against JRE 1.4 to make sure that no dependencies on JRE 1.5 have crept
>>in.  Finally, it will create an extra jar with the retrowoven classes as
>>part of the distribution.
>>
>>If you have comments on this process, please let me know.
>>
>>JVS
>>
>>
>>-------------------------------------------------------
>>SF.Net email is sponsored by: Discover Easy Linux Migration Strategies
>>from IBM. Find simple to follow Roadmaps, straightforward articles,
>>informative Webcasts and more! Get everything you need to get up to
>>speed, fast. http://ads.osdn.com/?ad_id=7477&alloc_id=16492&op=click
>>_______________________________________________
>>jgrapht-developers mailing list
>>jgr...@li...
>>https://lists.sourceforge.net/lists/listinfo/jgrapht-developers
> 
> 
> 
>