1 Oct
2018
1 Oct
'18
12:06 p.m.
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?