abdelrahman/agent_compositor_test
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Add graph references

Browse Source
This commit is contained in:
Abdelrahman Said
2026-06-28 13:49:01 +01:00
parent 0a9807e448
commit a11edf0c53
2578 changed files with 868045 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files
references/igraph-1.0.1/tests/unit/VF2-compat.c
+257
View File
@@ -0,0 +1,257 @@
/*
igraph library.
Copyright (C) 2012 Gabor Csardi <csardi.gabor@gmail.com>
334 Harvard street, Cambridge, MA 02139 USA
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
02110-1301 USA
*/
#include <igraph.h>
#include <stdlib.h>
#include "test_utilities.h"
/* ----------------------------------------------------------- */
/* Vertices/edges with the same parity match */
igraph_bool_t compat_parity(const igraph_t *graph1,
const igraph_t *graph2,
const igraph_int_t g1_num,
const igraph_int_t g2_num,
void *arg) {
IGRAPH_UNUSED(graph1);
IGRAPH_UNUSED(graph2);
IGRAPH_UNUSED(arg);
return (g1_num % 2) == (g2_num % 2);
}
/* Nothing vertex/edge 0 in graph1 */
igraph_bool_t compat_not0(const igraph_t *graph1,
const igraph_t *graph2,
const igraph_int_t g1_num,
const igraph_int_t g2_num,
void *arg) {
IGRAPH_UNUSED(graph1);
IGRAPH_UNUSED(graph2);
IGRAPH_UNUSED(arg);
IGRAPH_UNUSED(g2_num);
return g1_num != 0;
}
int match_rings(void) {
igraph_t r1, r2;
igraph_bool_t iso;
igraph_int_t count;
igraph_ring(&r1, 10, /*directed=*/ 0, /*mutual=*/ 0, /*circular=*/ 1);
igraph_ring(&r2, 10, /*directed=*/ 0, /*mutual=*/ 0, /*circular=*/ 1);
igraph_isomorphic_vf2(&r1, &r2, /*colors(4x)*/ 0, 0, 0, 0,
&iso, /*map12=*/ 0, /*map21=*/ 0,
/*node_compat_fn=*/ 0, /*edge_compat_fn=*/ 0,
/*arg=*/ 0);
if (!iso) {
exit(1);
}
igraph_isomorphic_vf2(&r1, &r2, /*colors(4x)*/ 0, 0, 0, 0,
&iso, /*map12=*/ 0, /*map21=*/ 0,
compat_parity, /*edge_compat_fn=*/ 0, /*arg=*/ 0);
if (!iso) {
exit(2);
}
igraph_isomorphic_vf2(&r1, &r2, /*colors(4x)*/ 0, 0, 0, 0,
&iso, /*map12=*/ 0, /*map21=*/ 0,
compat_not0, /*edge_compat_fn=*/ 0, /*arg=*/ 0);
if (iso) {
exit(3);
}
/* ------- */
igraph_isomorphic_vf2(&r1, &r2, /*colors(4x)*/ 0, 0, 0, 0,
&iso, /*map12=*/ 0, /*map21=*/ 0,
/*node_compat_fn=*/ 0, compat_parity, /*arg=*/ 0);
if (!iso) {
exit(4);
}
igraph_isomorphic_vf2(&r1, &r2, /*colors(4x)*/ 0, 0, 0, 0,
&iso, /*map12=*/ 0, /*map21=*/ 0,
/*node_compat_fn=*/ 0, compat_not0, /*arg=*/ 0);
if (iso) {
exit(5);
}
/* ------- */
igraph_count_isomorphisms_vf2(&r1, &r2, /*colors(4x)*/ 0, 0, 0, 0,
&count, /*node_compat_fn=*/ 0,
/*edge_compat_fn=*/ 0, /*arg=*/ 0);
if (count != 20) {
exit(6);
}
igraph_count_isomorphisms_vf2(&r1, &r2, /*colors(4x)*/ 0, 0, 0, 0,
&count, compat_parity, /*edge_compat_fn=*/ 0,
/*arg=*/ 0);
if (count != 10) {
exit(7);
}
igraph_count_isomorphisms_vf2(&r1, &r2, /*colors(4x)*/ 0, 0, 0, 0,
&count, compat_not0, /*edge_compat_fn=*/ 0,
/*arg=*/ 0);
if (count != 0) {
exit(8);
}
/* ------- */
igraph_count_isomorphisms_vf2(&r1, &r2, /*colors(4x)*/ 0, 0, 0, 0,
&count, /*node_compat_fn=*/ 0, compat_parity,
/*arg=*/ 0);
if (count != 10) {
exit(9);
}
igraph_count_isomorphisms_vf2(&r1, &r2, /*colors(4x)*/ 0, 0, 0, 0,
&count, /*node_compat_fn=*/ 0, compat_not0,
/*arg=*/ 0);
if (count != 0) {
exit(10);
}
igraph_destroy(&r1);
igraph_destroy(&r2);
return 0;
}
int match_rings_open_closed(void) {
igraph_t ro, rc;
igraph_bool_t iso;
igraph_int_t count;
igraph_ring(&ro, 10, /*directed=*/ 0, /*mutual=*/ 0, /*circular=*/ 0);
igraph_ring(&rc, 10, /*directed=*/ 0, /*mutual=*/ 0, /*circular=*/ 1);
igraph_subisomorphic_vf2(&rc, &ro, /*colors(4x)*/ 0, 0, 0, 0,
&iso, /*map12=*/ 0, /*map21=*/ 0,
/*node_compat_fn=*/ 0, /*edge_compat_fn=*/ 0,
/*arg=*/ 0);
if (!iso) {
exit(31);
}
igraph_subisomorphic_vf2(&rc, &ro, /*colors(4x)*/ 0, 0, 0, 0,
&iso, /*map12=*/ 0, /*map21=*/ 0,
compat_parity, /*edge_compat_fn=*/ 0,
/*arg=*/ 0);
if (!iso) {
exit(32);
}
igraph_subisomorphic_vf2(&rc, &ro, /*colors(4x)*/ 0, 0, 0, 0,
&iso, /*map12=*/ 0, /*map21=*/ 0,
compat_not0, /*edge_compat_fn=*/ 0,
/*arg=*/ 0);
if (iso) {
exit(33);
}
/* ------- */
igraph_subisomorphic_vf2(&rc, &ro, /*colors(4x)*/ 0, 0, 0, 0,
&iso, /*map12=*/ 0, /*map21=*/ 0,
/*node_compat_fn=*/ 0, compat_parity,
/*arg=*/ 0);
if (!iso) {
exit(34);
}
igraph_subisomorphic_vf2(&rc, &ro, /*colors(4x)*/ 0, 0, 0, 0,
&iso, /*map12=*/ 0, /*map21=*/ 0,
/*node_compat_fn=*/ 0, compat_not0,
/*arg=*/ 0);
if (!iso) {
exit(35);
}
/* ------- */
igraph_count_subisomorphisms_vf2(&rc, &ro, /*colors(4x)*/ 0, 0, 0, 0,
&count, /*node_compat_fn=*/ 0,
/*edge_compat_fn=*/ 0, /*arg=*/ 0);
if (count != 20) {
exit(36);
}
igraph_count_subisomorphisms_vf2(&rc, &ro, /*colors(4x)*/ 0, 0, 0, 0,
&count, compat_parity,
/*edge_compat_fn=*/ 0, /*arg=*/ 0);
if (count != 10) {
exit(37);
}
igraph_count_subisomorphisms_vf2(&rc, &ro, /*colors(4x)*/ 0, 0, 0, 0,
&count, compat_not0, /*edge_compat_fn=*/ 0,
/*arg=*/ 0);
if (count != 0) {
exit(38);
}
/* ------- */
igraph_count_subisomorphisms_vf2(&rc, &ro, /*colors(4x)*/ 0, 0, 0, 0,
&count, /*node_compat_fn=*/ 0,
compat_parity, /*arg=*/ 0);
if (count != 10) {
exit(39);
}
igraph_count_subisomorphisms_vf2(&rc, &ro, /*colors(4x)*/ 0, 0, 0, 0,
&count, /*node_compat_fn=*/ 0, compat_not0,
/*arg=*/ 0);
if (count != 2) {
exit(40);
}
igraph_destroy(&ro);
igraph_destroy(&rc);
return 0;
}
/* ----------------------------------------------------------- */
int main(void) {
match_rings();
match_rings_open_closed();
VERIFY_FINALLY_STACK();
return 0;
}