You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
I have a large graph. Performing path_dict = all_pairs_dijkstra_shortest_paths takes about 1 second, and produces a huge nested dict of 1.6 million source-target combinations.
Of the nodes in the graph, I am only interested in the shortest path between the combination of about 100 source nodes and 100 target nodes (resulting in 500 * 500 paths) of them.
Doing lookup in the path_dict is quite slow when looping over so many locations. I tried using dijkstra_shortest_paths as well, but each lookup is also quite slow, since I have to specify only one target and source at a time.
I would therefore very much appreciate a way to specify more than one target and source to dijkstra_shortest_paths, so as to speed this bit up.
The text was updated successfully, but these errors were encountered:
What is the expected enhancement?
I have a large graph. Performing
path_dict = all_pairs_dijkstra_shortest_paths
takes about 1 second, and produces a huge nested dict of 1.6 million source-target combinations.Of the nodes in the graph, I am only interested in the shortest path between the combination of about 100 source nodes and 100 target nodes (resulting in 500 * 500 paths) of them.
Doing lookup in the
path_dict
is quite slow when looping over so many locations. I tried usingdijkstra_shortest_paths
as well, but each lookup is also quite slow, since I have to specify only one target and source at a time.I would therefore very much appreciate a way to specify more than one target and source to
dijkstra_shortest_paths
, so as to speed this bit up.The text was updated successfully, but these errors were encountered: