[graph-tool] How to efficiently work with large graphs up to a maximum search distance?

Tiago de Paula Peixoto tiago at skewed.de
Fri Oct 14 17:57:05 CEST 2016


On 11.10.2016 23:29, Gareth Simons wrote:
> There is quite a bit of looping going on and I’m wondering if there is a simpler way to calculate all-pairs shortest paths to a maximum distance while minimising duplication of shortest path searches?

Nothing comes to mind. If you need the paths, you will have to call
shortest_path() for all desired pairs of vertices.

-- 
Tiago de Paula Peixoto <tiago at skewed.de>

-------------- next part --------------
A non-text attachment was scrubbed...
Name: signature.asc
Type: application/pgp-signature
Size: 801 bytes
Desc: OpenPGP digital signature
URL: <https://lists.skewed.de/pipermail/graph-tool/attachments/20161014/7a68a4fb/attachment.asc>


More information about the graph-tool mailing list