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
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
|
/* -*- mode: C -*- */
/*
IGraph library.
Copyright (C) 2009-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>
void permute(const igraph_matrix_t *M,
const igraph_vector_int_t *p,
const igraph_vector_int_t *q,
igraph_matrix_t *res) {
igraph_integer_t nrow = igraph_vector_int_size(p);
igraph_integer_t ncol = igraph_vector_int_size(q);
igraph_integer_t i, j;
igraph_matrix_resize(res, nrow, ncol);
for (i = 0; i < nrow; i++) {
for (j = 0; j < ncol; j++) {
igraph_integer_t ii = VECTOR(*p)[i];
igraph_integer_t jj = VECTOR(*q)[j];
MATRIX(*res, i, j) = MATRIX(*M, ii, jj);
}
}
}
void permute_rows(const igraph_matrix_t *M,
const igraph_vector_int_t *p,
igraph_matrix_t *res) {
igraph_integer_t nrow = igraph_vector_int_size(p);
igraph_integer_t ncol = igraph_matrix_ncol(M);
igraph_integer_t i, j;
igraph_matrix_resize(res, nrow, ncol);
for (i = 0; i < nrow; i++) {
for (j = 0; j < ncol; j++) {
igraph_integer_t ii = VECTOR(*p)[i];
MATRIX(*res, i, j) = MATRIX(*M, ii, j);
}
}
}
void permute_cols(const igraph_matrix_t *M,
const igraph_vector_int_t *q,
igraph_matrix_t *res) {
igraph_integer_t nrow = igraph_matrix_nrow(M);
igraph_integer_t ncol = igraph_vector_int_size(q);
igraph_integer_t i, j;
igraph_matrix_resize(res, nrow, ncol);
for (i = 0; i < nrow; i++) {
for (j = 0; j < ncol; j++) {
igraph_integer_t jj = VECTOR(*q)[j];
MATRIX(*res, i, j) = MATRIX(*M, i, jj);
}
}
}
void random_permutation(igraph_vector_int_t *vec) {
/* We just do size(vec) * 2 swaps */
igraph_integer_t one, two, i, n = igraph_vector_int_size(vec);
igraph_integer_t tmp;
for (i = 0; i < 2 * n; i++) {
one = RNG_INTEGER(0, n - 1);
two = RNG_INTEGER(0, n - 1);
tmp = VECTOR(*vec)[one];
VECTOR(*vec)[one] = VECTOR(*vec)[two];
VECTOR(*vec)[two] = tmp;
}
}
igraph_bool_t check_same(const igraph_sparsemat_t *A,
const igraph_matrix_t *M) {
igraph_matrix_t A_dense;
igraph_bool_t result;
igraph_matrix_init(&A_dense, 1, 1);
igraph_sparsemat_as_matrix(&A_dense, A);
result = igraph_matrix_all_e(&A_dense, M);
igraph_matrix_destroy(&A_dense);
return result;
}
int main(void) {
igraph_sparsemat_t A, B;
igraph_matrix_t M, N;
igraph_vector_int_t p, q;
igraph_integer_t i;
RNG_BEGIN();
/* Permutation of a matrix */
#define NROW 10
#define NCOL 5
#define EDGES NROW*NCOL/3
igraph_matrix_init(&M, NROW, NCOL);
igraph_sparsemat_init(&A, NROW, NCOL, EDGES);
for (i = 0; i < EDGES; i++) {
igraph_integer_t r = RNG_INTEGER(0, NROW - 1);
igraph_integer_t c = RNG_INTEGER(0, NCOL - 1);
igraph_real_t value = RNG_INTEGER(1, 5);
MATRIX(M, r, c) = MATRIX(M, r, c) + value;
igraph_sparsemat_entry(&A, r, c, value);
}
igraph_sparsemat_compress(&A, &B);
igraph_sparsemat_destroy(&A);
igraph_vector_int_init_range(&p, 0, NROW);
igraph_vector_int_init_range(&q, 0, NCOL);
/* Identity */
igraph_matrix_init(&N, 0, 0);
permute(&M, &p, &q, &N);
igraph_sparsemat_permute(&B, &p, &q, &A);
igraph_sparsemat_dupl(&A);
if (! check_same(&A, &N)) {
return 1;
}
/* Random permutation */
random_permutation(&p);
random_permutation(&q);
permute(&M, &p, &q, &N);
igraph_sparsemat_destroy(&A);
igraph_sparsemat_permute(&B, &p, &q, &A);
igraph_sparsemat_dupl(&A);
if (! check_same(&A, &N)) {
return 2;
}
igraph_vector_int_destroy(&p);
igraph_vector_int_destroy(&q);
igraph_sparsemat_destroy(&A);
igraph_sparsemat_destroy(&B);
igraph_matrix_destroy(&M);
igraph_matrix_destroy(&N);
#undef NROW
#undef NCOL
#undef EDGES
/* Indexing */
#define NROW 10
#define NCOL 5
#define EDGES NROW*NCOL/3
#define I_NROW 6
#define I_NCOL 3
igraph_matrix_init(&M, NROW, NCOL);
igraph_sparsemat_init(&A, NROW, NCOL, EDGES);
for (i = 0; i < EDGES; i++) {
igraph_integer_t r = RNG_INTEGER(0, NROW - 1);
igraph_integer_t c = RNG_INTEGER(0, NCOL - 1);
igraph_real_t value = RNG_INTEGER(1, 5);
MATRIX(M, r, c) = MATRIX(M, r, c) + value;
igraph_sparsemat_entry(&A, r, c, value);
}
igraph_sparsemat_compress(&A, &B);
igraph_sparsemat_destroy(&A);
igraph_vector_int_init(&p, I_NROW);
igraph_vector_int_init(&q, I_NCOL);
for (i = 0; i < I_NROW; i++) {
VECTOR(p)[i] = RNG_INTEGER(0, I_NROW - 1);
}
for (i = 0; i < I_NCOL; i++) {
VECTOR(p)[i] = RNG_INTEGER(0, I_NCOL - 1);
}
igraph_matrix_init(&N, 0, 0);
permute(&M, &p, &q, &N);
igraph_sparsemat_index(&B, &p, &q, &A, 0);
if (! check_same(&A, &N)) {
return 3;
}
igraph_sparsemat_destroy(&A);
/* Getting single elements with index() */
igraph_vector_int_resize(&p, 1);
igraph_vector_int_resize(&q, 1);
for (i = 0; i < 100; i++) {
igraph_real_t value;
VECTOR(p)[0] = RNG_INTEGER(0, NROW - 1);
VECTOR(q)[0] = RNG_INTEGER(0, NCOL - 1);
igraph_sparsemat_index(&B, &p, &q, /*res=*/ 0, &value);
if (value != MATRIX(M, VECTOR(p)[0], VECTOR(q)[0])) {
return 4;
}
}
/* Getting single elements with get() */
igraph_vector_int_resize(&p, 1);
igraph_vector_int_resize(&q, 1);
for (i = 0; i < 100; i++) {
igraph_integer_t row = RNG_INTEGER(0, NROW - 1);
igraph_integer_t col = RNG_INTEGER(0, NCOL - 1);
if (igraph_sparsemat_get(&B, row, col) != MATRIX(M, row, col)) {
return 4;
}
}
/* Getting submatrices with index() */
for (i = 0; i < 100; i++) {
igraph_real_t value;
VECTOR(p)[0] = RNG_INTEGER(0, NROW - 1);
VECTOR(q)[0] = RNG_INTEGER(0, NCOL - 1);
igraph_sparsemat_index(&B, &p, &q, /*res=*/ &A, &value);
igraph_sparsemat_destroy(&A);
if (value != MATRIX(M, VECTOR(p)[0], VECTOR(q)[0])) {
return 4;
}
}
igraph_vector_int_destroy(&p);
igraph_vector_int_destroy(&q);
igraph_sparsemat_destroy(&B);
igraph_matrix_destroy(&M);
igraph_matrix_destroy(&N);
/* Indexing only the rows or the columns */
igraph_matrix_init(&M, NROW, NCOL);
igraph_sparsemat_init(&A, NROW, NCOL, EDGES);
for (i = 0; i < EDGES; i++) {
igraph_integer_t r = RNG_INTEGER(0, NROW - 1);
igraph_integer_t c = RNG_INTEGER(0, NCOL - 1);
igraph_real_t value = RNG_INTEGER(1, 5);
MATRIX(M, r, c) = MATRIX(M, r, c) + value;
igraph_sparsemat_entry(&A, r, c, value);
}
igraph_sparsemat_compress(&A, &B);
igraph_sparsemat_destroy(&A);
igraph_vector_int_init(&p, I_NROW);
igraph_vector_int_init(&q, I_NCOL);
for (i = 0; i < I_NROW; i++) {
VECTOR(p)[i] = RNG_INTEGER(0, I_NROW - 1);
}
for (i = 0; i < I_NCOL; i++) {
VECTOR(p)[i] = RNG_INTEGER(0, I_NCOL - 1);
}
igraph_matrix_init(&N, 0, 0);
permute_rows(&M, &p, &N);
igraph_sparsemat_index(&B, &p, 0, &A, 0);
if (! check_same(&A, &N)) {
return 5;
}
permute_cols(&M, &q, &N);
igraph_sparsemat_destroy(&A);
igraph_sparsemat_index(&B, 0, &q, &A, 0);
if (! check_same(&A, &N)) {
return 6;
}
igraph_sparsemat_destroy(&A);
igraph_sparsemat_destroy(&B);
igraph_vector_int_destroy(&p);
igraph_vector_int_destroy(&q);
igraph_matrix_destroy(&M);
igraph_matrix_destroy(&N);
RNG_END();
return 0;
}
|
