Hi Moses, > Is it possible to modify the igraph functions for the counts of graph > motifs to do this? But how?
It is not possible with the motif count functions (well, without modifying their source of course), but it is possible with subgraph isomorphism. Construct a small subgraph that contains a path of length 2, and search for all subisomorphisms using the VF2 subisomorphism algorithm. Since igraph 0.6, you can specify vertex/edge colors for the input graphs and two vertices/edges will match only if their colors match; also, you can add a callback function that decides whether two vertices/edges are compatible or not. Best, Tamas _______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
