Hi Stephan, If the number of start-end pairs is not high you could compute all shortest paths and then remove the ones you are not interested in. Best, Aleks On Wed, Nov 17, 2021 at 3:55 PM Monecke, Stephan <stephan.monecke@ds.mpg.de> wrote:
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
_______________________________________________ graph-tool mailing list -- graph-tool@skewed.de To unsubscribe send an email to graph-tool-leave@skewed.de