[feature request] Find all paths connecting two vertices

As per our discussion on the mailing list (http://main-discussion-list-for-the-graph-tool-project.982480.n3.nabble.com/How-is-all-shortest-paths-defined-td4026472.html ) I am opening a feature request for a function that returns all paths connecting two given vertices in a network. Ideally this would list the paths in order of increasing length and presumably allow the user to specify some criterion to terminate the search to prevent combinatorial explosion in the case of very large, highly connected, networks.

It appears as if NetworkX has implemented a function addressing this: https://networkx.github.io/documentation/latest/reference/generated/networkx.algorithms.simple_paths.shortest_simple_paths.html#networkx.algorithms.simple_paths.shortest_simple_paths https://networkx.github.io/documentation/development/reference/generated/networkx.algorithms.simple_paths.all_simple_paths.html