Hi,

 

I want to know the shortest distances from any single vertex to any other vertices, and the largest one out of them (I call it the maximum diameter of a graph). How can I do that?

 

Thanks!

 

 

Dan