1
2 #include <igraph.h>
3 #include "test_utilities.inc"
4
5
6 #define PRINT_DESTROY(name) \
7 printf(name "\n"); \
8 print_graph_canon(&graph); \
9 igraph_destroy(&graph); \
10 printf("\n");
11
12
main()13 int main() {
14 igraph_t graph;
15
16 igraph_tree(&graph, 0, 1, IGRAPH_TREE_UNDIRECTED);
17 PRINT_DESTROY("Null graph");
18
19 igraph_tree(&graph, 0, 1, IGRAPH_TREE_OUT);
20 PRINT_DESTROY("Directed null graph");
21
22 igraph_tree(&graph, 1, 1, IGRAPH_TREE_UNDIRECTED);
23 PRINT_DESTROY("Singleton graph");
24
25 igraph_tree(&graph, 3, 1, IGRAPH_TREE_OUT);
26 PRINT_DESTROY("Path graph");
27
28 igraph_tree(&graph, 3, 2, IGRAPH_TREE_OUT);
29 PRINT_DESTROY("Binary out-tree, n=3");
30
31 igraph_tree(&graph, 3, 2, IGRAPH_TREE_IN);
32 PRINT_DESTROY("Binary in-tree, n=3");
33
34 igraph_tree(&graph, 14, 3, IGRAPH_TREE_OUT);
35 PRINT_DESTROY("Ternary out-tree, n=14");
36
37 VERIFY_FINALLY_STACK();
38
39 return 0;
40 }
41