Find all possible paths between two vertices on a graph

[titomiguelcosta]

Is there a way to determine all possible paths between two vertices?

[letournel]

Unfortunately, there is currently no out of box solution for this in the library. Feel free to make a contribution in the case you need to implement it ;)

However, i might add that depending on the size and connectivity of the graph, it can become quite slow very quickly. Indeed, to know all the paths between two vertices, we need to check and compute every simple path (no cycle) between them. There can be 2^(n-1) of them in the worst case (ie in a fully connected undirected graph of n vertices) and even more (typically O(n!) I think) if the order of the visited vertices matters (ex: the path cost would be different in a directed graph).

Food for thought :
http://stackoverflow.com/questions/9535819/find-all-paths-between-two-graph-nodes
http://stackoverflow.com/questions/713508/find-the-paths-between-two-given-nodes
http://mathematica.stackexchange.com/questions/25779/finding-all-simple-paths-between-two-vertices-in-a-graph
http://cs.stackexchange.com/questions/423/how-hard-is-counting-the-number-of-simple-paths-between-two-nodes-in-a-directed

Will let the issue open ;)

[titomiguelcosta]

@letournel thanks for your reply, in the end, I followed this tutorial and implemented using a recursive sql query, something that i wasn't even aware it was possible.