Even though this thread is about 6 months old I find it really very useful, as I am currently working on a similar project and have struggled with it, being quite a young programmer.I have read through it all and feel that I might be able to get the help that I need.
I have a network containing about 2500 edges (directed) and I am looking at being able to work out all the routes downstream from a given beginning node. The difference from neversaint's problem is that both beginning and end nodes are supplied in his.My initial concerns was that it'd result in very large output that may not be manageable but considering that it is currently not a very large network and that I really need to identify all the routes i am willing to give it a try.
I will be happy to have your inputs and thoughts
Thank you very much in advance