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
|
/* -*- mode: C -*- */
/*
IGraph library.
Copyright (C) 2008-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>
#include <stdlib.h>
void print_vector_int(igraph_vector_int_t *v, FILE *f) {
igraph_integer_t i;
for (i = 0; i < igraph_vector_int_size(v); i++) {
fprintf(f, " %" IGRAPH_PRId, VECTOR(*v)[i]);
}
fprintf(f, "\n");
}
int main(void) {
igraph_t g;
igraph_integer_t nodes = 100;
igraph_integer_t edges = 1000;
igraph_real_t p = 3.0 / nodes;
igraph_integer_t runs = 10;
igraph_integer_t r, e, ecount;
igraph_vector_int_t eids, pairs, path;
igraph_rng_seed(igraph_rng_default(), 42); /* make tests deterministic */
igraph_vector_int_init(&pairs, edges * 2);
igraph_vector_int_init(&path, 0);
igraph_vector_int_init(&eids, 0);
for (r = 0; r < runs; r++) {
igraph_vector_int_resize(&pairs, edges * 2);
igraph_vector_int_clear(&path);
igraph_vector_int_clear(&eids);
igraph_erdos_renyi_game(&g, IGRAPH_ERDOS_RENYI_GNP, nodes, p,
/*directed=*/ 0, /*loops=*/ 0);
ecount = igraph_ecount(&g);
for (e = 0; e < edges; e++) {
igraph_integer_t edge = RNG_INTEGER(0, ecount - 1);
VECTOR(pairs)[2 * e] = IGRAPH_FROM(&g, edge);
VECTOR(pairs)[2 * e + 1] = IGRAPH_TO(&g, edge);
}
igraph_get_eids(&g, &eids, &pairs, /* directed= */ 0, /*error=*/ 1);
for (e = 0; e < edges; e++) {
igraph_integer_t edge = VECTOR(eids)[e];
igraph_integer_t from1 = VECTOR(pairs)[2 * e];
igraph_integer_t to1 = VECTOR(pairs)[2 * e + 1];
igraph_integer_t from2 = IGRAPH_FROM(&g, edge);
igraph_integer_t to2 = IGRAPH_TO(&g, edge);
igraph_integer_t min1 = from1 < to1 ? from1 : to1;
igraph_integer_t max1 = from1 < to1 ? to1 : from1;
igraph_integer_t min2 = from2 < to2 ? from2 : to2;
igraph_integer_t max2 = from2 < to2 ? to2 : from2;
if (min1 != min2 || max1 != max2) {
return 11;
}
}
igraph_diameter(&g, /*res=*/ 0, /*from=*/ 0, /*to=*/ 0, &path, NULL,
IGRAPH_UNDIRECTED, /*unconn=*/ 1);
igraph_vector_int_update(&pairs, &path);
igraph_expand_path_to_pairs(&pairs);
igraph_get_eids(&g, &eids, &pairs, 0, /*error=*/ 1);
for (e = 0; e < igraph_vector_int_size(&path) - 1; e++) {
igraph_integer_t edge = VECTOR(eids)[e];
igraph_integer_t from1 = VECTOR(path)[e];
igraph_integer_t to1 = VECTOR(path)[e + 1];
igraph_integer_t from2 = IGRAPH_FROM(&g, edge);
igraph_integer_t to2 = IGRAPH_TO(&g, edge);
igraph_integer_t min1 = from1 < to1 ? from1 : to1;
igraph_integer_t max1 = from1 < to1 ? to1 : from1;
igraph_integer_t min2 = from2 < to2 ? from2 : to2;
igraph_integer_t max2 = from2 < to2 ? to2 : from2;
if (min1 != min2 || max1 != max2) {
return 12;
}
}
igraph_destroy(&g);
}
igraph_vector_int_destroy(&path);
igraph_vector_int_destroy(&pairs);
igraph_vector_int_destroy(&eids);
return 0;
}
|
