title: What is the best way to find all possible paths between two nodes in large networks scale?
body: <p>I wonder that what is the best way to find all possible paths from a source to a destination in a very large network scale (in a network matrix), i.e. 5000 nodes. I have used this <a href="https://github.com/kakearney/pathbetweennodes-pkg/blob/master/pathbetweennodes/pathbetweennodes.m" rel="nofollow">function</a> that is implemented using stacks, but its limit seems about 60 nodes and it can't retrieve the paths for a 200-node network. In another approach, DFS (depth-first search) could be one of the options but this algorithm also uses stack, so I am afraid of its scalability. Thus, do we have any efficient way for finding all paths between two given nodes in such a large network?      </p>