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 <ti...@skewed.de>

Attachment: signature.asc
Description: OpenPGP digital signature

graph-tool mailing list

Reply via email to