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
|
/*
IGraph library.
Copyright (C) 2022 The igraph development team <igraph@igraph.org>
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, see <https://www.gnu.org/licenses/>.
*/
#include <igraph.h>
#include <stdio.h>
#include "test_utilities.h"
void print_sparse_matrix(const igraph_sparsemat_t* sm) {
igraph_matrix_t m;
igraph_matrix_init(&m, 0, 0);
igraph_sparsemat_as_matrix(&m, sm);
igraph_matrix_print(&m);
igraph_matrix_destroy(&m);
}
void test_undirected(void) {
igraph_t graph;
igraph_real_t weights_array[] = { 5, 4, 3, 2, 1, 6, 3, 2 };
igraph_vector_t weights;
igraph_sparsemat_t m;
igraph_small(&graph, 5, IGRAPH_UNDIRECTED, 0, 1, 1, 2, 2, 3, 3, 4, 4, 0, 0, 3, 2, 2, 0, 1, -1);
igraph_vector_view(&weights, weights_array, igraph_ecount(&graph));
igraph_sparsemat_init(&m, 2, 2, 0);
printf("Undirected, unweighted, upper, no loops:\n");
igraph_get_adjacency_sparse(&graph, &m, IGRAPH_GET_ADJACENCY_UPPER, NULL, IGRAPH_NO_LOOPS);
print_sparse_matrix(&m);
printf("========\n");
printf("Undirected, unweighted, upper, loops once:\n");
igraph_get_adjacency_sparse(&graph, &m, IGRAPH_GET_ADJACENCY_UPPER, NULL, IGRAPH_LOOPS_ONCE);
print_sparse_matrix(&m);
printf("========\n");
printf("Undirected, unweighted, upper, loops twice:\n");
igraph_get_adjacency_sparse(&graph, &m, IGRAPH_GET_ADJACENCY_UPPER, NULL, IGRAPH_LOOPS_TWICE);
print_sparse_matrix(&m);
printf("========\n");
printf("Undirected, unweighted, lower, no loops:\n");
igraph_get_adjacency_sparse(&graph, &m, IGRAPH_GET_ADJACENCY_LOWER, NULL, IGRAPH_NO_LOOPS);
print_sparse_matrix(&m);
printf("========\n");
printf("Undirected, unweighted, lower, loops once:\n");
igraph_get_adjacency_sparse(&graph, &m, IGRAPH_GET_ADJACENCY_LOWER, NULL, IGRAPH_LOOPS_ONCE);
print_sparse_matrix(&m);
printf("========\n");
printf("Undirected, unweighted, lower, loops twice:\n");
igraph_get_adjacency_sparse(&graph, &m, IGRAPH_GET_ADJACENCY_LOWER, NULL, IGRAPH_LOOPS_TWICE);
print_sparse_matrix(&m);
printf("========\n");
printf("Undirected, unweighted, both, no loops:\n");
igraph_get_adjacency_sparse(&graph, &m, IGRAPH_GET_ADJACENCY_BOTH, NULL, IGRAPH_NO_LOOPS);
print_sparse_matrix(&m);
printf("========\n");
printf("Undirected, unweighted, both, loops once:\n");
igraph_get_adjacency_sparse(&graph, &m, IGRAPH_GET_ADJACENCY_BOTH, NULL, IGRAPH_LOOPS_ONCE);
print_sparse_matrix(&m);
printf("========\n");
printf("Undirected, unweighted, both, loops twice:\n");
igraph_get_adjacency_sparse(&graph, &m, IGRAPH_GET_ADJACENCY_BOTH, NULL, IGRAPH_LOOPS_TWICE);
print_sparse_matrix(&m);
printf("========\n");
printf("Undirected, weighted, upper, no loops:\n");
igraph_get_adjacency_sparse(&graph, &m, IGRAPH_GET_ADJACENCY_UPPER, &weights, IGRAPH_NO_LOOPS);
print_sparse_matrix(&m);
printf("========\n");
printf("Undirected, weighted, upper, loops once:\n");
igraph_get_adjacency_sparse(&graph, &m, IGRAPH_GET_ADJACENCY_UPPER, &weights, IGRAPH_LOOPS_ONCE);
print_sparse_matrix(&m);
printf("========\n");
printf("Undirected, weighted, upper, loops twice:\n");
igraph_get_adjacency_sparse(&graph, &m, IGRAPH_GET_ADJACENCY_UPPER, &weights, IGRAPH_LOOPS_TWICE);
print_sparse_matrix(&m);
printf("========\n");
printf("Undirected, weighted, lower, no loops:\n");
igraph_get_adjacency_sparse(&graph, &m, IGRAPH_GET_ADJACENCY_LOWER, &weights, IGRAPH_NO_LOOPS);
print_sparse_matrix(&m);
printf("========\n");
printf("Undirected, weighted, lower, loops once:\n");
igraph_get_adjacency_sparse(&graph, &m, IGRAPH_GET_ADJACENCY_LOWER, &weights, IGRAPH_LOOPS_ONCE);
print_sparse_matrix(&m);
printf("========\n");
printf("Undirected, weighted, lower, loops twice:\n");
igraph_get_adjacency_sparse(&graph, &m, IGRAPH_GET_ADJACENCY_LOWER, &weights, IGRAPH_LOOPS_TWICE);
print_sparse_matrix(&m);
printf("========\n");
printf("Undirected, weighted, both, no loops:\n");
igraph_get_adjacency_sparse(&graph, &m, IGRAPH_GET_ADJACENCY_BOTH, &weights, IGRAPH_NO_LOOPS);
print_sparse_matrix(&m);
printf("========\n");
printf("Undirected, weighted, both, loops once:\n");
igraph_get_adjacency_sparse(&graph, &m, IGRAPH_GET_ADJACENCY_BOTH, &weights, IGRAPH_LOOPS_ONCE);
print_sparse_matrix(&m);
printf("========\n");
printf("Undirected, weighted, both, loops twice:\n");
igraph_get_adjacency_sparse(&graph, &m, IGRAPH_GET_ADJACENCY_BOTH, &weights, IGRAPH_LOOPS_TWICE);
print_sparse_matrix(&m);
printf("========\n");
igraph_sparsemat_destroy(&m);
igraph_destroy(&graph);
VERIFY_FINALLY_STACK();
}
void test_directed(void) {
igraph_t graph;
igraph_real_t weights_array[] = { 5, 4, 3, 2, 1, 6, 3, 2 };
igraph_vector_t weights;
igraph_sparsemat_t m;
igraph_small(&graph, 5, IGRAPH_DIRECTED, 0, 1, 1, 2, 2, 3, 3, 4, 4, 0, 0, 3, 2, 2, 0, 1, -1);
igraph_vector_view(&weights, weights_array, igraph_ecount(&graph));
igraph_sparsemat_init(&m, 2, 2, 0);
printf("Directed, unweighted, no loops:\n");
igraph_get_adjacency_sparse(&graph, &m, IGRAPH_GET_ADJACENCY_BOTH, NULL, IGRAPH_NO_LOOPS);
print_sparse_matrix(&m);
printf("========\n");
printf("Directed, unweighted, loops once:\n");
igraph_get_adjacency_sparse(&graph, &m, IGRAPH_GET_ADJACENCY_BOTH, NULL, IGRAPH_LOOPS_ONCE);
print_sparse_matrix(&m);
printf("========\n");
printf("Directed, unweighted, loops twice (same as once):\n");
igraph_get_adjacency_sparse(&graph, &m, IGRAPH_GET_ADJACENCY_BOTH, NULL, IGRAPH_LOOPS_TWICE);
print_sparse_matrix(&m);
printf("========\n");
printf("Directed, weighted, no loops:\n");
igraph_get_adjacency_sparse(&graph, &m, IGRAPH_GET_ADJACENCY_BOTH, &weights, IGRAPH_NO_LOOPS);
print_sparse_matrix(&m);
printf("========\n");
printf("Directed, weighted, loops once:\n");
igraph_get_adjacency_sparse(&graph, &m, IGRAPH_GET_ADJACENCY_BOTH, &weights, IGRAPH_LOOPS_ONCE);
print_sparse_matrix(&m);
printf("========\n");
printf("Directed, weighted, loops twice (same as once):\n");
igraph_get_adjacency_sparse(&graph, &m, IGRAPH_GET_ADJACENCY_BOTH, &weights, IGRAPH_LOOPS_TWICE);
print_sparse_matrix(&m);
printf("========\n");
igraph_sparsemat_destroy(&m);
igraph_destroy(&graph);
VERIFY_FINALLY_STACK();
}
void test_errors(void) {
igraph_t graph;
igraph_sparsemat_t m;
igraph_small(&graph, 5, IGRAPH_UNDIRECTED, 0, 1, 1, 2, 2, 3, 3, 4, 4, 0, 0, 3, 2, 2, 0, 1, -1);
igraph_sparsemat_init(&m, 2, 2, 0);
CHECK_ERROR(igraph_get_adjacency_sparse(&graph, &m, (igraph_get_adjacency_t) 42, NULL, IGRAPH_LOOPS_ONCE), IGRAPH_EINVAL);
igraph_sparsemat_destroy(&m);
igraph_destroy(&graph);
VERIFY_FINALLY_STACK();
}
int main(void) {
test_undirected();
test_directed();
test_errors();
return 0;
}
|
