Re: [jgrapht-users] JGraphT update -- Floyd-Warshal algorithms

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

Thanks a lot!  I have committed it to Subversion.

JVS

Tom Larkworthy wrote:
> Hello, I wrote this in order to get the diameter of a graph
> 
> Calculates all shortests path pairs in O(n^3)
> 
> in (correct) package:-
> 
> org.jgrapht.alg
> 
> 
> There is a test in the main
> 
> Hope it helps
> 
> Tom Larkworthy
>