0

I want to compute all shortest paths between each pair of nodes in an undirected weighted graph. I am currently using graph_tool.topology.shortest_distance, from the graph_tool python library, but it seems to be running in one core only. Is there a way to make it run in parallel?

Joel
  • 20,138
  • 3
  • 61
  • 86
Rayamon
  • 164
  • 1
  • 7

1 Answers1

0

graph-tool uses the boost graph library for its shortest path algorithms, but doesn't use its parallel graph library, as far as I know.

You could try calling the parallel library from python using some methods referenced here.

Alternatively, you could try JuliaGraphs's parallel implementations in Julia.

chester-tan
  • 1