[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [igraph] Maximum Common Subgraph
From: |
Tamas Nepusz |
Subject: |
Re: [igraph] Maximum Common Subgraph |
Date: |
Fri, 11 Mar 2011 12:41:17 +0100 |
User-agent: |
Mozilla/5.0 (X11; U; Linux x86_64; en-US; rv:1.9.2.14) Gecko/20110223 Lightning/1.0b2 Thunderbird/3.1.8 |
>
> 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.
--
T.
- [igraph] Maximum Common Subgraph, Mark Galea, 2011/03/10
- Re: [igraph] Maximum Common Subgraph, Horváth Árpád, 2011/03/11
- Re: [igraph] Maximum Common Subgraph, Mark Galea, 2011/03/11
- Re: [igraph] Maximum Common Subgraph, Tamas Nepusz, 2011/03/11
- Re: [igraph] Maximum Common Subgraph, Mark Galea, 2011/03/11
- Re: [igraph] Maximum Common Subgraph, Tamas Nepusz, 2011/03/11
- Re: [igraph] Maximum Common Subgraph, Mark Galea, 2011/03/11
- Re: [igraph] Maximum Common Subgraph,
Tamas Nepusz <=
- Re: [igraph] Maximum Common Subgraph, Mark Galea, 2011/03/11
- Re: [igraph] Maximum Common Subgraph, Tamas Nepusz, 2011/03/11
- Re: [igraph] Maximum Common Subgraph, Mark Galea, 2011/03/11
- Re: [igraph] Maximum Common Subgraph, Tamas Nepusz, 2011/03/11
- Re: [igraph] Maximum Common Subgraph, Mark Galea, 2011/03/11
- Re: [igraph] Maximum Common Subgraph, Mark Galea, 2011/03/11
- Re: [igraph] Maximum Common Subgraph, Tamas Nepusz, 2011/03/11
- Re: [igraph] Maximum Common Subgraph, Mark Galea, 2011/03/11
- Re: [igraph] Maximum Common Subgraph, Tamás Nepusz, 2011/03/11
- Re: [igraph] Maximum Common Subgraph, Mark Galea, 2011/03/11