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.