[graph-tool] All Pairs Shortest Path with limitations

Hi together, I have a question on how you would tackle the following: I have a graph and want to calculate all possible shortest paths but exclude a few nodes as starting / stopping positions. I can not filter out those vertices, since paths should be allowed to pass them - just not start or terminate there. Calculating all possible shortest paths manually is computationally infeasible. Thanks a lot! Stephan _______________________________________________ graph-tool mailing list -- graph-tool@skewed.de To unsubscribe send an email to graph-tool-leave@skewed.de