Skip to content

GitLab

graph-tool
graph-tool

Please use the issue tracker only to report bugs (i.e. errors in the library that need to be fixed) or feature requests.

For questions about how to compile, install or use the library, please use instead the mailing list at https://graph-tool.skewed.de/mailing
(If unsure, use the mailing list first.)



When opening new issues, please choose the BUG template from the drop-down menu, and fill out the required information.

Open
Opened by Fabrício@FdeFabricio

[feature request] Weighted diameter and average distance

I am working with large graphs calculating diameter and average path length. I am using the shortest_distance() function with weights which returns the dist_map then I use the get_2d_array() to convert to a np.array and calculate the diameter (np.max) and the average distance (np.mean). The problem is that the shortest_distance() is taking around 6 minutes but the get_2d_array() is taking much more than that, which is strange. I wonder if maybe having both average distance and diameter implemented C++ wouldn't provide a huge performance boost.

Is there any other alternative for what I am trying to do? I can provide the graph in .graphml if it can be of any help.