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
119
120
121
122
123
124
125
126
127
|
/* -*- mode: C -*- */
/*
IGraph library.
Copyright (C) 2006 Gabor Csardi <csardi@rmki.kfki.hu>
MTA RMKI, Konkoly-Thege Miklos st. 29-33, Budapest 1121, Hungary
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>
#include <assert.h>
int main() {
igraph_t g;
igraph_vector_t tdist;
igraph_matrix_t pmat;
igraph_bool_t conn;
igraph_vector_bool_t bs;
int i, ret;
/* Symmetric preference game */
igraph_vector_bool_init(&bs, 0);
igraph_vector_init_real(&tdist, 3, 1.0, 1.0, 1.0);
igraph_matrix_init(&pmat, 3, 3);
for (i=0; i<3; i++) MATRIX(pmat, i, i) = 0.2;
/* undirected, no loops */
IGRAPH_CHECK(igraph_preference_game(&g, 1000, 3, &tdist, &pmat, 0, 0, 0));
if (igraph_vcount(&g) != 1000) return 18;
if (igraph_is_directed(&g)) return 2;
igraph_is_connected(&g, &conn, IGRAPH_STRONG);
if (conn) return 3;
igraph_is_loop(&g, &bs, igraph_ess_all(IGRAPH_EDGEORDER_ID));
if (igraph_vector_bool_sum(&bs)) return 4;
igraph_is_multiple(&g, &bs, igraph_ess_all(IGRAPH_EDGEORDER_ID));
if (igraph_vector_bool_sum(&bs)) return 5;
igraph_destroy(&g);
for (i=0; i<2; i++) MATRIX(pmat, i, i+1) = 0.1;
/* directed, no loops */
IGRAPH_CHECK(igraph_preference_game(&g, 1000, 3, &tdist, &pmat, 0, 1, 0));
if (igraph_vcount(&g) != 1000) return 17;
if (!igraph_is_directed(&g)) return 6;
igraph_is_loop(&g, &bs, igraph_ess_all(IGRAPH_EDGEORDER_ID));
if (igraph_vector_bool_sum(&bs)) return 7;
igraph_is_multiple(&g, &bs, igraph_ess_all(IGRAPH_EDGEORDER_ID));
if (igraph_vector_bool_sum(&bs)) return 8;
igraph_destroy(&g);
/* undirected, loops */
for (i=0; i<3; i++) MATRIX(pmat, i, i) = 1.0;
IGRAPH_CHECK(igraph_preference_game(&g, 100, 3, &tdist, &pmat, 0, 0, 1));
if (igraph_vcount(&g) != 100) return 16;
if (igraph_ecount(&g) < 1395) return 20;
if (igraph_is_directed(&g)) return 9;
igraph_is_loop(&g, &bs, igraph_ess_all(IGRAPH_EDGEORDER_ID));
if (igraph_vector_bool_sum(&bs) == 0) return 10;
igraph_is_multiple(&g, &bs, igraph_ess_all(IGRAPH_EDGEORDER_ID));
if (igraph_vector_bool_sum(&bs)) return 11;
igraph_destroy(&g);
/* directed, loops */
IGRAPH_CHECK(igraph_preference_game(&g, 100, 3, &tdist, &pmat, 0, 1, 1));
if (igraph_vcount(&g) != 100) return 15;
if (igraph_ecount(&g) < 2700) return 19;
if (!igraph_is_directed(&g)) return 12;
igraph_is_loop(&g, &bs, igraph_ess_all(IGRAPH_EDGEORDER_ID));
if (igraph_vector_bool_sum(&bs) == 0) return 13;
igraph_is_multiple(&g, &bs, igraph_ess_all(IGRAPH_EDGEORDER_ID));
if (igraph_vector_bool_sum(&bs)) return 14;
igraph_destroy(&g);
/* Asymmetric preference game */
/* directed, no loops */
igraph_matrix_resize(&pmat, 2, 2);
MATRIX(pmat, 0, 0) = 1; MATRIX(pmat, 0, 1) = 1;
MATRIX(pmat, 1, 0) = 1; MATRIX(pmat, 1, 1) = 1;
IGRAPH_CHECK(igraph_asymmetric_preference_game(&g, 100, 2, 0, &pmat, 0, 0, 0));
if (igraph_vcount(&g) != 100) return 21;
if (igraph_ecount(&g) != 9900) return 22;
if (!igraph_is_directed(&g)) return 23;
igraph_is_loop(&g, &bs, igraph_ess_all(IGRAPH_EDGEORDER_ID));
if (igraph_vector_bool_sum(&bs)) return 24;
igraph_is_multiple(&g, &bs, igraph_ess_all(IGRAPH_EDGEORDER_ID));
if (igraph_vector_bool_sum(&bs)) return 25;
igraph_destroy(&g);
/* directed, loops */
igraph_matrix_resize(&pmat, 2, 2);
MATRIX(pmat, 0, 0) = 1; MATRIX(pmat, 0, 1) = 1;
MATRIX(pmat, 1, 0) = 1; MATRIX(pmat, 1, 1) = 1;
IGRAPH_CHECK(igraph_asymmetric_preference_game(&g, 100, 2, 0, &pmat, 0, 0, 1));
if (igraph_vcount(&g) != 100) return 26;
if (igraph_ecount(&g) != 10000) return 27;
if (!igraph_is_directed(&g)) return 28;
igraph_is_loop(&g, &bs, igraph_ess_all(IGRAPH_EDGEORDER_ID));
if (igraph_vector_bool_sum(&bs) != 100) return 29;
igraph_is_multiple(&g, &bs, igraph_ess_all(IGRAPH_EDGEORDER_ID));
if (igraph_vector_bool_sum(&bs)) return 30;
igraph_destroy(&g);
igraph_vector_destroy(&tdist);
igraph_matrix_destroy(&pmat);
igraph_vector_bool_destroy(&bs);
assert(IGRAPH_FINALLY_STACK_EMPTY);
return 0;
}
|
