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
|
/* -*- 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/igraph.h>
#include <math.h>
void print_vector(igraph_vector_t *v, FILE *f) {
long int i;
for (i=0; i<igraph_vector_size(v); i++) {
fprintf(f, " %li", (long int) VECTOR(*v)[i]);
}
fprintf(f, "\n");
}
int main() {
igraph_t g;
igraph_matrix_t coords;
long int i, n;
igraph_vector_t v;
int ret;
/* Create graph */
igraph_vector_init(&v, 8);
VECTOR(v)[0]=0; VECTOR(v)[1]=1;
VECTOR(v)[2]=1; VECTOR(v)[3]=2;
VECTOR(v)[4]=2; VECTOR(v)[5]=3;
VECTOR(v)[6]=2; VECTOR(v)[7]=2;
igraph_create(&g, &v, 0, 1);
/* Add edges */
igraph_vector_resize(&v, 4);
VECTOR(v)[0]=2; VECTOR(v)[1]=1;
VECTOR(v)[2]=3; VECTOR(v)[3]=3;
igraph_add_edges(&g, &v, 0);
/* Check result */
igraph_get_edgelist(&g, &v, 0);
igraph_vector_sort(&v);
print_vector(&v, stdout);
/* Error, vector length */
igraph_set_error_handler(igraph_error_handler_ignore);
igraph_vector_resize(&v, 3);
VECTOR(v)[0]=0; VECTOR(v)[1]=1;
VECTOR(v)[2]=2;
ret=igraph_add_edges(&g, &v, 0);
if (ret != IGRAPH_EINVEVECTOR) {
return 1;
}
/* Check result */
igraph_get_edgelist(&g, &v, 0);
igraph_vector_sort(&v);
print_vector(&v, stdout);
/* Error, vector ids */
igraph_vector_resize(&v, 4);
VECTOR(v)[0]=0; VECTOR(v)[1]=1;
VECTOR(v)[2]=2; VECTOR(v)[3]=4;
ret=igraph_add_edges(&g, &v, 0);
if (ret != IGRAPH_EINVVID) {
return 2;
}
/* Check result */
igraph_get_edgelist(&g, &v, 0);
igraph_vector_sort(&v);
print_vector(&v, stdout);
//f=fopen("igraph_layout_reingold_tilford.in", "r");
//igraph_read_graph_edgelist(&g, f, 0, 1);
igraph_matrix_init(&coords, 0, 0);
igraph_layout_reingold_tilford(&g, &coords, IGRAPH_IN, 0, 0);
n=igraph_vcount(&g);
for (i=0; i<n; i++) {
printf("%6.3f %6.3f\n", MATRIX(coords, i, 0), MATRIX(coords, i, 1));
}
igraph_vector_destroy(&v);
igraph_matrix_destroy(&coords);
igraph_destroy(&g);
return 0;
}
|
