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
|
/*
igraph library.
Copyright (C) 2006-2012 Gabor Csardi <csardi.gabor@gmail.com>
334 Harvard st, 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 graph;
igraph_bool_t res;
/* Initialize the library. */
igraph_setup();
/* Create a directed binary tree on 15 nodes,
with edges pointing towards the root. */
igraph_kary_tree(&graph, 15, 2, IGRAPH_TREE_IN);
igraph_is_tree(&graph, &res, NULL, IGRAPH_IN);
printf("Is it an in-tree? %s\n", res ? "Yes" : "No");
igraph_is_tree(&graph, &res, NULL, IGRAPH_OUT);
printf("Is it an out-tree? %s\n", res ? "Yes" : "No");
igraph_destroy(&graph);
return 0;
}
|
