Hello,

Is is possible to limit the total number of paths between two given 
vertices/nodes
for a given graph? I mean, I could easily return all and select a subset of it, but it'd not be efficient I guess. Is there a way to do that without returning all paths first?
_______________________________________________
graph-tool mailing list
graph-tool@skewed.de
https://lists.skewed.de/mailman/listinfo/graph-tool

Reply via email to