1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
|
/* -*- mode: C -*- */
/*
IGraph library.
Copyright (C) 2008-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>
int main(void) {
igraph_t g, g2;
igraph_adjlist_t adjlist;
igraph_bool_t iso;
/* Create a directed out-tree, convert it into an adjacency list
* representation, then reconstruct the graph from the tree and check
* whether the two are isomorphic (they should be) */
igraph_kary_tree(&g, 42, 3, IGRAPH_TREE_OUT);
igraph_adjlist_init(&g, &adjlist, IGRAPH_OUT, IGRAPH_LOOPS_ONCE, IGRAPH_MULTIPLE);
igraph_adjlist(&g2, &adjlist, IGRAPH_OUT, /* duplicate = */ 0);
igraph_isomorphic(&g, &g2, &iso);
if (!iso) {
return 1;
}
igraph_adjlist_destroy(&adjlist);
igraph_destroy(&g2);
igraph_destroy(&g);
return 0;
}
|
