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
attachment.html (792 Bytes)
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
attachment.html (792 Bytes)
You can get the distance histogram with the --distance-histogram option,
and then get the largest value. See
http://projects.forked.de/graph-tool/wiki/BasicStatistics#DistanceHistogram
Cheers,
Tiago