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
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
|
/* -*- mode: C -*- */
/*
IGraph library.
Copyright (C) 2006-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() {
igraph_t g;
igraph_vector_t v, v2;
int i, ret;
igraph_barabasi_game(&g, 10, /*power=*/ 1, 2, 0, 0, /*A=*/ 1, 1,
IGRAPH_BARABASI_BAG, /*start_from=*/ 0);
if (igraph_ecount(&g) != 18) {
return 1;
}
if (igraph_vcount(&g) != 10) {
return 2;
}
if (!igraph_is_directed(&g)) {
return 3;
}
igraph_vector_init(&v, 0);
igraph_get_edgelist(&g, &v, 0);
for (i=0; i<igraph_ecount(&g); i++) {
if (VECTOR(v)[2*i] <= VECTOR(v)[2*i+1]) {
return 4;
}
}
igraph_destroy(&g);
/* out degree sequence */
igraph_vector_resize(&v, 10);
VECTOR(v)[0]=0; VECTOR(v)[1]=1;
VECTOR(v)[2]=3; VECTOR(v)[3]=3;
VECTOR(v)[4]=4; VECTOR(v)[5]=5;
VECTOR(v)[6]=6; VECTOR(v)[7]=7;
VECTOR(v)[8]=8; VECTOR(v)[9]=9;
igraph_barabasi_game(&g, 10, /*power=*/ 1, 0, &v, 0, /*A=*/ 1, 1,
IGRAPH_BARABASI_BAG, /*start_from=*/ 0);
if (igraph_ecount(&g) != igraph_vector_sum(&v)) {
return 5;
}
igraph_vector_init(&v2, 0);
igraph_degree(&g, &v2, igraph_vss_all(), IGRAPH_OUT, 1);
for (i=0; i<igraph_vcount(&g); i++) {
if (VECTOR(v)[i] != VECTOR(v2)[i]) {
igraph_vector_print(&v);
printf("\n");
igraph_vector_print(&v2);
return 6;
}
}
igraph_vector_destroy(&v);
igraph_vector_destroy(&v2);
igraph_destroy(&g);
/* outpref, we cannot really test this quantitatively,
would need to set random seed */
igraph_barabasi_game(&g, 10, /*power=*/ 1, 2, 0, 1, /*A=*/ 1, 1,
IGRAPH_BARABASI_BAG, /*start_from=*/ 0);
igraph_vector_init(&v, 0);
igraph_get_edgelist(&g, &v, 0);
for (i=0; i<igraph_ecount(&g); i++) {
if (VECTOR(v)[2*i] <= VECTOR(v)[2*i+1]) {
return 7;
}
}
if (!igraph_is_directed(&g)) {
return 8;
}
igraph_vector_destroy(&v);
igraph_destroy(&g);
/* Error tests */
igraph_set_error_handler(igraph_error_handler_ignore);
ret=igraph_barabasi_game(&g, -10, /*power=*/ 1, 1, 0, 0, /*A=*/ 1, 0,
IGRAPH_BARABASI_BAG, /*start_from=*/ 0);
if (ret != IGRAPH_EINVAL) {
return 9;
}
ret=igraph_barabasi_game(&g, 10, /*power=*/ 1, -2, 0, 0, /*A=*/ 1, 0,
IGRAPH_BARABASI_BAG, /*start_from=*/ 0);
if (ret != IGRAPH_EINVAL) {
return 10;
}
igraph_vector_init(&v, 9);
ret=igraph_barabasi_game(&g, 10, /*power=*/ 1, 0, &v, 0, /*A=*/ 1, 0,
IGRAPH_BARABASI_BAG, /*start_from=*/ 0);
if (ret != IGRAPH_EINVAL) {
return 11;
}
igraph_vector_destroy(&v);
return 0;
}
|
