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
|
/*
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>
int main(void) {
igraph_t g;
igraph_vs_t vs;
igraph_vit_t vit;
igraph_int_t size;
/* Initialize the library. */
igraph_setup();
/* empty graph, all vertices */
igraph_empty(&g, 10, IGRAPH_DIRECTED);
igraph_vs_nonadj(&vs, 0, IGRAPH_ALL);
igraph_vs_size(&g, &vs, &size);
printf("%" IGRAPH_PRId " ", size);
igraph_vit_create(&g, vs, &vit);
while (!IGRAPH_VIT_END(vit)) {
printf("%" IGRAPH_PRId " ", IGRAPH_VIT_GET(vit));
IGRAPH_VIT_NEXT(vit);
}
printf("\n");
igraph_vit_destroy(&vit);
igraph_vs_destroy(&vs);
igraph_destroy(&g);
/* full graph, no vertices */
igraph_full(&g, 10, IGRAPH_UNDIRECTED, IGRAPH_LOOPS);
igraph_vs_nonadj(&vs, 0, IGRAPH_ALL);
igraph_vit_create(&g, vs, &vit);
while (!IGRAPH_VIT_END(vit)) {
printf("%" IGRAPH_PRId " ", IGRAPH_VIT_GET(vit));
IGRAPH_VIT_NEXT(vit);
}
printf("\n");
igraph_vit_destroy(&vit);
igraph_vs_destroy(&vs);
igraph_destroy(&g);
return 0;
}
|
