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
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
|
#include <igraph.h>
int main(void) {
igraph_t g;
igraph_vector_int_t outdeg, indeg;
igraph_vector_int_t vec;
igraph_bool_t is_simple;
/* Set random seed for reproducibility */
igraph_rng_seed(igraph_rng_default(), 42);
igraph_vector_int_init_int(&outdeg, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3);
igraph_vector_int_init_int(&indeg, 10, 4, 4, 2, 2, 4, 4, 2, 2, 3, 3);
igraph_vector_int_init(&vec, 0);
/* checking the configuration model, undirected graphs */
igraph_degree_sequence_game(&g, &outdeg, 0, IGRAPH_DEGSEQ_CONFIGURATION);
if (igraph_is_directed(&g) || igraph_vcount(&g) != 10) {
return 1;
}
if (igraph_degree(&g, &vec, igraph_vss_all(), IGRAPH_OUT, 1)) {
return 2;
}
igraph_vector_int_print(&vec);
igraph_destroy(&g);
/* checking the Viger-Latapy method, undirected graphs */
igraph_degree_sequence_game(&g, &outdeg, 0, IGRAPH_DEGSEQ_VL);
if (igraph_is_directed(&g) || igraph_vcount(&g) != 10) {
return 3;
}
if (igraph_is_simple(&g, &is_simple) || !is_simple) {
return 4;
}
if (igraph_degree(&g, &vec, igraph_vss_all(), IGRAPH_OUT, 0)) {
return 5;
}
igraph_vector_int_print(&vec);
igraph_destroy(&g);
/* checking the configuration model, directed graphs */
igraph_degree_sequence_game(&g, &outdeg, &indeg, IGRAPH_DEGSEQ_CONFIGURATION);
if (!igraph_is_directed(&g) || igraph_vcount(&g) != 10) {
return 6;
}
if (igraph_degree(&g, &vec, igraph_vss_all(), IGRAPH_OUT, 1)) {
return 7;
}
igraph_vector_int_print(&vec);
if (igraph_degree(&g, &vec, igraph_vss_all(), IGRAPH_IN, 1)) {
return 8;
}
igraph_vector_int_print(&vec);
igraph_destroy(&g);
/* checking the fast heuristic method, undirected graphs */
igraph_degree_sequence_game(&g, &outdeg, 0, IGRAPH_DEGSEQ_FAST_HEUR_SIMPLE);
if (igraph_is_directed(&g) || igraph_vcount(&g) != 10) {
return 9;
}
if (igraph_is_simple(&g, &is_simple) || !is_simple) {
return 10;
}
if (igraph_degree(&g, &vec, igraph_vss_all(), IGRAPH_OUT, 1)) {
return 11;
}
igraph_vector_int_print(&vec);
igraph_destroy(&g);
/* checking the fast heuristic method, directed graphs */
igraph_degree_sequence_game(&g, &outdeg, &indeg, IGRAPH_DEGSEQ_FAST_HEUR_SIMPLE);
if (!igraph_is_directed(&g) || igraph_vcount(&g) != 10) {
return 12;
}
if (igraph_is_simple(&g, &is_simple) || !is_simple) {
return 13;
}
if (igraph_degree(&g, &vec, igraph_vss_all(), IGRAPH_OUT, 1)) {
return 14;
}
igraph_vector_int_print(&vec);
if (igraph_degree(&g, &vec, igraph_vss_all(), IGRAPH_IN, 1)) {
return 15;
}
igraph_vector_int_print(&vec);
igraph_destroy(&g);
igraph_vector_int_destroy(&vec);
igraph_vector_int_destroy(&outdeg);
igraph_vector_int_destroy(&indeg);
return 0;
}
|
