[igraph] All shortest paths from list of starting nodes.

[Chris Wj]

Which function in igraph should I use to obtain all the shortest paths from a list of starting vertices to a list of ending vertices where each path begins with a starting vertex and ends with any ending vertex?

starting vertices: {1,2}
ending vertices: {8,9,10}
all shortest paths desired: 1 -> 8, 1 -> 9, 1 -> 10, 2 -> 8, 2 -> 9, 2 -> 10

Right now I just call the get_all_shortest_paths(starting_node,ending_nodes) for each starting_node in my list of starting nodes.

Thanks