Although I am not completely sure if it works with loops, but loops are relatively easy to handle by hand in this case.
Gabor On Sat, Nov 15, 2014 at 10:13 AM, Gábor Csárdi <[email protected]> wrote: > Hi, the development version has a function for all simple paths, > called get.all.simple.paths. > > Gabor > > On Sat, Nov 15, 2014 at 7:39 AM, Mh Djamila <[email protected]> wrote: >> Hi >> >> Are there any method in igraph package R that can get all possibles paths >> between two vertices in a directed cyclic graph with loops? >> >> Thanks >> >> _______________________________________________ >> 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
