Thank you very much for the response! I got it to work but it is slow in a graph with only 7436 vertices. It is taking 3 hours so far and it has not terminated. What is the expectation as far as graph size is concerned? Any chance to speed it up too or preprocess before we run the algorithm?
Thanks again! -Ahmed On Thu, Nov 21, 2013 at 9:49 PM, Gábor Csárdi <[email protected]>wrote: > Hi, this is not implemented in igraph. Maybe you could look at this > for how to implement it for yourself: > > http://stackoverflow.com/questions/3971876/all-possible-paths-from-one-node-to-another-in-a-directed-tree-igraph > > Gabor > > On Thu, Nov 21, 2013 at 9:33 PM, Ahmed Abdeen Hamed > <[email protected]> wrote: > > Hello friends, > > > > I am trying to compute all possible paths in a given network. I am > calling > > the g.get_all_shortest_paths(index_s, index_t) method but I don't know > if it > > is implemented in a way that it can find all possible paths for the > index_s > > and index_t nodes. Is there another method I should be using? My graph is > > directed with no weights assigned to the edges. > > > > Thanks very much, > > > > -Ahmed > > > > > > > > _______________________________________________ > > igraph-help mailing list > > [email protected] > > https://lists.nongnu.org/mailman/listinfo/igraph-help > > >
_______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
