Many-to-all shortest path

Hi,
       I went over the documentation and some foruns but I was not able to
find the answer for a question that is crucial for me.

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

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.

Thanks,
Pedro

attachment.html (530 Bytes)

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++.

Thanks, Thiago.

In that case, I guess I need ond copy of the graph per thread. Correct?

And since we are at it, does anybody have experience in using graph-tool
wrapped inside Cython code?

Cheers,
Pedro

attachment.html (1.64 KB)