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
|
/*
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(void) {
igraph_t g;
igraph_vector_int_t v1, v2;
/* Initialize the library. */
igraph_setup();
/* simple use */
igraph_vector_int_init(&v1, 8);
VECTOR(v1)[0] = 0;
VECTOR(v1)[1] = 1;
VECTOR(v1)[2] = 1;
VECTOR(v1)[3] = 2;
VECTOR(v1)[4] = 2;
VECTOR(v1)[5] = 3;
VECTOR(v1)[6] = 2;
VECTOR(v1)[7] = 2;
igraph_create(&g, &v1, 0, 0);
if (igraph_vcount(&g) != 4) {
return 1;
}
igraph_vector_int_init(&v2, 0);
igraph_get_edgelist(&g, &v2, 0);
igraph_vector_int_sort(&v1);
igraph_vector_int_sort(&v2);
if (!igraph_vector_int_all_e(&v1, &v2)) {
return 2;
}
igraph_destroy(&g);
/* higher number of vertices */
igraph_create(&g, &v1, 10, 0);
if (igraph_vcount(&g) != 10) {
return 1;
}
igraph_get_edgelist(&g, &v2, 0);
igraph_vector_int_sort(&v1);
igraph_vector_int_sort(&v2);
if (!igraph_vector_int_all_e(&v1, &v2)) {
return 3;
}
igraph_destroy(&g);
igraph_vector_int_destroy(&v1);
igraph_vector_int_destroy(&v2);
return 0;
}
|
