Is it possible to list all simple paths of length k between source and target in igraph? networkx has a function http://networkx.github.io/documentation/latest/_modules/networkx/algorithms/simple_paths.html#all_simple_paths which might be a useful starting point but producing them all and filtering by length seems very inefficient.
Marshall _______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
