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
_______________________________________________
graph-tool mailing list
[email protected]
https://lists.skewed.de/mailman/listinfo/graph-tool
