Generate All Paths In An Efficient Way Using Networkx In Python

I am trying to generate all paths with at most 6 nodes from every origin to every destination in a fairly large network (20,000+ arcs). I am using networkx and python 2.7. For smal

Solution 1:

I actually asked this question previously about optimizing an algorithm I wrote previously using networkx. Essentially what you'll want to do is move away from a recursive function, and towards a solution that uses memoization like I did.

From here you can do further optimizations like using multiple cores, or picking the next node to traverse based on criteria such as degree.