Skip to content

GitLab

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.

Closed
Created by Raymond van Venetie@rayvanve

Improve all pairs distance (unweighted graph)

Hi,

Could you optimize topology.shortest_distance in the case of an (undirected) unweighted graph? It seems that you use a general APSP algorithm with weight 1. In the calculation of the closeness centrality you've already optimized this by running bfs for all vertices.

See also, http://math.stackexchange.com/questions/58198/all-pairs-shortest-path-in-undirected-and-unweighted-graphs

Thanks!