graph/path_enumeration_utils library
Enumerate all simple paths between two nodes (roadmap #543).
A simple path visits no node more than once, so even cyclic graphs yield a
finite set of paths and the DFS can never loop forever. Beware: the number
of simple paths can grow exponentially, so bound dense graphs with
enumeratePaths's maxDepth.