Pass list of sources and targets to dijkstra_shortest_paths

[thomasaarholt]

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

[fabmazz]

I'm interested in this enhancement too (in the distance flavor). From what I understand from my basic Rust by looking at the code, it would be fairly straight-forward to implement the search of the paths limiting the starting nodes to a list provided as an argument.