Re: [jgrapht-users] Dijkstra Algorithm

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

If you want all pairs, use FloydWarshallShortestPaths instead.

JVS

On Tue, Apr 5, 2011 at 1:53 PM, Alejandro Riveros Cruz
<lal...@gm...> wrote:
> Hi,
>
> First of all  thanks for your great work in the design and support of
> JGraphT.
> Currently i'm working in my master final  work, in this work i need to
> calculate some similarity measures, based on path distances between vertex
> over directed graphs, for this purpose a develop a java program that
> performs the calculus using jgrapht.
> Currently i have some problems, first the graphs are big, each graph has in
> average 50000 vertex and more than 50000  edges.
> I read about the Dijkstra algorithm and i know that if using the appropiate
> structure  i.e. a priority queue, this algorithm can perform the search of
> all shortest path between a selected vertex and all other vertex, in a
> computational reasonable time.
>
> Searching on jGraphT library i found a Dijkstra implementaion for searching
> the shortest path between two nodes, but no the implementation for searching
> the shortest path between  all nodes, for this reason i  need to know if my
> assumption about the implementation of Dijkstra is true? in such case, you
> have planned the release of that algorithm soon?
>
>
> Thanks in advance,
>
> Alejandro Riveros
>
> --
> Alejandro Riveros Cruz
> Ingeniero de Sistemas
> Universidad Nacional de Colombia
>
> ------------------------------------------------------------------------------
> Xperia(TM) PLAY
> It's a major breakthrough. An authentic gaming
> smartphone on the nation's most reliable network.
> And it wants your games.
> http://p.sf.net/sfu/verizon-sfdev
> _______________________________________________
> jgrapht-users mailing list
> jgr...@li...
> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
>
>