Re: [graph-tool] Many-to-all shortest path

On 19.01.2017 05:09, Pedro Camargo wrote:

Can I compute many-to-all Shortest paths (about 5,000 origins in a 100,000 nodes network) taking advantage of all computer processors?

This is not implemented, but can be achieved easily with threads or multiprocessing.

Looking at the code, it looks like Dijkstra is computed with the GIL locked, but I was not sure how it goes for the other algorithms.

I don't think this is true, since the library dispatches to C++. -- Tiago de Paula Peixoto <tiago@skewed.de>