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
|
/* -*- mode: C -*- */
/*
IGraph library.
Copyright (C) 2006-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 igraph_vector_print(const igraph_vector_t *v) {
long int i;
for (i=0; i<igraph_vector_size(v); i++) {
printf("%li ", (long int)VECTOR(*v)[i]);
}
printf("\n");
}
int main() {
igraph_t g;
const igraph_vector_t v=IGRAPH_VECTOR_NULL;
igraph_real_t edges1[] = { 0,1, 1,2, 2,2, 2,3, 2,4, 3,4 };
igraph_vector_t was;
igraph_integer_t size;
igraph_es_t it;
long int i;
igraph_vector_view(&v, edges1, sizeof(edges1)/sizeof(igraph_real_t));
igraph_vector_init(&was, 0);
/******************************************/
/* Directed graph */
/******************************************/
igraph_create(&g, &v, 0, IGRAPH_DIRECTED);
/* Simple test, all neighbors */
for (i=0; i<=igraph_vector_max(&v); i++) {
igraph_vector_clear(&was);
igraph_es_adj(&g, &it, i, IGRAPH_ALL);
igraph_es_size(&g, &it, &size);
printf("%ld\n", (long)size);
while (!igraph_es_end(&g, &it)) {
igraph_vector_push_back(&was, igraph_es_adj_vertex(&g, &it));
igraph_es_next(&g, &it);
}
igraph_es_destroy(&it);
igraph_vector_sort(&was);
igraph_vector_print(&was);
}
/* Simple test, outgoing neighbors */
for (i=0; i<=igraph_vector_max(&v); i++) {
igraph_vector_clear(&was);
igraph_es_adj(&g, &it, i, IGRAPH_OUT);
igraph_es_size(&g, &it, &size);
printf("%ld\n", (long)size);
while (!igraph_es_end(&g, &it)) {
igraph_vector_push_back(&was, igraph_es_adj_vertex(&g, &it));
igraph_es_next(&g, &it);
}
igraph_es_destroy(&it);
igraph_vector_sort(&was);
igraph_vector_print(&was);
}
/* Simple test, incoming neighbors */
for (i=0; i<=igraph_vector_max(&v); i++) {
igraph_vector_clear(&was);
igraph_es_adj(&g, &it, i, IGRAPH_IN);
igraph_es_size(&g, &it, &size);
printf("%ld\n", (long)size);
while (!igraph_es_end(&g, &it)) {
igraph_vector_push_back(&was, igraph_es_adj_vertex(&g, &it));
igraph_es_next(&g, &it);
}
igraph_es_destroy(&it);
igraph_vector_sort(&was);
igraph_vector_print(&was);
}
igraph_destroy(&g);
/******************************************/
/* Undirected graph */
/******************************************/
igraph_create(&g, &v, 0, IGRAPH_UNDIRECTED);
/* Simple test, all neighbors */
for (i=0; i<=igraph_vector_max(&v); i++) {
igraph_vector_clear(&was);
igraph_es_adj(&g, &it, i, IGRAPH_ALL);
igraph_es_size(&g, &it, &size);
printf("%ld\n", (long)size);
while (!igraph_es_end(&g, &it)) {
igraph_vector_push_back(&was, igraph_es_adj_vertex(&g, &it));
igraph_es_next(&g, &it);
}
igraph_es_destroy(&it);
igraph_vector_sort(&was);
igraph_vector_print(&was);
}
igraph_destroy(&g);
igraph_vector_destroy(&was);
return 0;
}
|
