Re: [igraph] Enumeration of subgraphs under constaints

[Gabor Csardi]

Nikolaos,

these are all we have:
http://cneurocvs.rmki.kfki.hu/igraph/doc/html/igraph-Motifs.html
and the VF2 subgraph isomorphism algorithm is included in the development
branch. (The one in 0.4.3 can only decide graph isomorphism.)

Could you explain it briefly what kind of functionality you want?
You want to create all non-isomorphic graphs with some constraints?
Or you want to count the number of subgraph isomorphisms of G1 in G2, with
either G1 and G2 fixed while other varies?
Maybe giving a link is enough.

Thanks,
Gabor

On Fri, Sep 21, 2007 at 01:48:46PM +0300, address@hidden wrote:
> 
> Dear friends,
> 
> i have a question: does igraph support (yet) any enumeration primitives for
> performing queries on graph databases (or single large graphs?)
> 
> Nikolaos Kavvadias
> 
> 
> 
> _______________________________________________
> igraph-help mailing list
> address@hidden
> http://lists.nongnu.org/mailman/listinfo/igraph-help

-- 
Csardi Gabor <address@hidden>    MTA RMKI, ELTE TTK