Re: [jgrapht-users] Dijkstra Algorithm
Brought to you by:
barak_naveh,
perfecthash
Menu
▾
▴
Re: [jgrapht-users] Dijkstra Algorithm
|
From: Alexander H. <ale...@my...> - 2011-04-06 06:51:24
|
Hi, I realized this as well. What John probably means is that Dijkstra is supposed to give you single soure shortest pairs, so the shortest paths from a singlde node to all other nodes in the graph. Currently, jgrapht only returns the shortest path in between two nodes (and it is unclear if it caches any information or if each call to Dijkstra has to recompute everything). Also it wold be nice to get some more shortest path algos for specific graphs (like DAG). Alex Am 06.04.2011 06:39, schrieb John Sichi: > 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 >> >> > ------------------------------------------------------------------------------ > 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 -- ------------------------------------------------------- Lehrstuhl I2 Seidl Sprachen und Beschreibungsstrukturen der Informatik Institut fuer Informatik Technische Universitaet Muenchen Boltzmannstrasse 3 85748 Garching http://www2.in.tum.de Telefon: +89 289 181806 Fax: +89 289 18161 ------------------------------------------------------- |
