It's been a very long time ago I used jgrapht, but if I recall
correctly, dijkstra's shortest path algorithm is implemented in
jgrapht. Simply find the shortest path between two vertices, and
calculate the amount of edges in the path.
br,
Joris
On Tue, Mar 9, 2010 at 8:42 PM, stratio <st...@ho...> wrote:
>
> Hi all, I would like to know how i can calculate the distance (expressed in
> numbers of edges...) between two vertices with jgrapht?
> --
> View this message in context: http://n3.nabble.com/Distance-of-a-vertex-from-a-source-tp438087p438087.html
> Sent from the jgrapht-users mailing list archive at Nabble.com.
>
> ------------------------------------------------------------------------------
> Download Intel® Parallel Studio Eval
> Try the new software tools for yourself. Speed compiling, find bugs
> proactively, and fine-tune applications for parallel performance.
> See why Intel Parallel Studio got high marks during beta.
> http://p.sf.net/sfu/intel-sw-dev
> _______________________________________________
> jgrapht-users mailing list
> jgr...@li...
> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
>
|
