Will it works with large biograph

[eragonngo]

Hi kakearney,

I tried to implement your code to list all the possible paths from my bio-graph object with 67 nodes and 166 edges but it is hanging. Do you have any suggestion for this case.

My bio-graph has 15 level, each level has 5 nodes beside level 1 and 15

• Level 1:
  • Node 1 connects to Node 2-> Node 6
• Level 2:
  • Node 2 and Node 6 can only connect to 2 nodes (Node 7,8 and Node 10,11 respectively) while the rest (Node 3,4,5) can connect to 3 nodes.
• ....
• Level 15:
  • Node 67 can connect from Node 62 to Node 66

I wonder base on my scenario, I can modify your possiblepath algorithm to cut down the computational time ?

[kakearney]

Will it work? Yes. Will it be fast? Probably not, especially if there are any loops in the graph (i.e. edges from higher levels pointing to lower levels). I’ve had similar-sized graphs (even without loops) take a couple hours to traverse.

You say the code hangs, but are you sure? For a graph that size I’d definitely set the verbose flag (fourth input) to true; that way, you can see the progress and get an idea of how quickly things are proceeding. If it does actually stop and hang rather than printing out traversed paths, please post an update.

As for modifying the algorithm, I’m sure there are ways to improve upon it. This is a pretty brute force method. You’re welcome to try to improve it! But I do not have the time to do so myself.

[eragonngo]

Thank you so much for your time answering my question. I will run your code and leave the computer during the weekend to check for the computing time