[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [igraph] 3-paths with vertex attributes

From: Tamás Nepusz
Subject: Re: [igraph] 3-paths with vertex attributes
Date: Wed, 1 Aug 2012 12:07:37 +0200

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.


reply via email to

[Prev in Thread] Current Thread [Next in Thread]