Hi, given a digraph, how do I find all paths of given length? what if all the edges in the path must have the same attribute? thanks! -- Sam Steingold (http://sds.podval.org/) on Ubuntu 11.10 (oneiric) X 11.0.11004000 http://www.childpsy.net/ http://www.PetitionOnline.com/tap12009/ http://memri.org http://pmw.org.il http://americancensorship.org Isn't "Microsoft Works" an advertisement lie?
_______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
