[Top][All Lists]

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

Re: [igraph] Maximum Common Subgraph

From: Mark Galea
Subject: Re: [igraph] Maximum Common Subgraph
Date: Fri, 11 Mar 2011 13:02:44 +0000

Hi Tamas, 

Thanks for your feedback.  I might be missing something but how do I download igraph 0.6 for python? Where can I find this build?

Could you shed some light into this?



On Fri, Mar 11, 2011 at 11:41 AM, Tamas Nepusz <address@hidden> wrote:

> Will try that soon. Could you perhaps provide an example or the api
> call I actually need to use.
Assuming that you are working in C, the header of the corresponding
function is as follows (see topology.c):

int igraph_subisomorphic_vf2(const igraph_t *graph1, const igraph_t
*graph2, const igraph_vector_int_t *vertex_color1, const
igraph_vector_int_t *vertex_color2, const igraph_vector_int_t
*edge_color1, const igraph_vector_int_t *edge_color2, igraph_bool_t
*iso, igraph_vector_t *map12, igraph_vector_t *map21);

Compared to 0.5.4, arguments 3-6 are new; you wil have to pass the
labels (encoded as integers) to vertex_color1 and vertex_color2, while
you can leave edge_color1 and edge_color2 as NULL.


reply via email to

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