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
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
|
/**
* 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 3 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, see
* <http://www.gnu.org/licenses/>.
*
* (c) Vincenzo Nicosia 2009-2017 -- <v.nicosia@qmul.ac.uk>
*
* This file is part of NetBunch, a package for complex network
* analysis and modelling. For more information please visit:
*
* http://www.complex-networks.net/
*
* If you use this software, please add a reference to
*
* V. Latora, V. Nicosia, G. Russo
* "Complex Networks: Principles, Methods and Applications"
* Cambridge University Press (2017)
* ISBN: 9781107103184
*
***********************************************************************
*
* This program computes the distance from a given node to all the
* other nodes of an undirected graph, using the Breadth-First Search
* algorithm.
*
*
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "utils.h"
void usage(char *argv[]){
printf("********************************************************************\n"
"** **\n"
"** -*- shortest_avg_max_hist -*- **\n"
"** **\n"
"** Compute the distance from the given 'node' to all the other **\n"
"** nodes of an undirected graph. The first parameter 'graph_in' **\n"
"** is the name of the file containing the edge list of the **\n"
"** graph. The second parameter 'node' is the label of the node **\n"
"** for which we want to compute the distances to all the other **\n"
"** nodes. **\n"
"** **\n"
"** If 'graph_in' is equal to '-' (dash), read the edge list **\n"
"** from standard input (STDIN) **\n"
"** **\n"
"** The program prints on output a row containing: **\n"
"** **\n"
"** - The average shortest path length between 'node' and **\n"
"** all the other nodes **\n"
"** - The maximum distance to any other node (eccentricity) **\n"
"** - The number of nodes at distance 1, 2, 3, .... from 'node' **\n"
"** **\n"
"********************************************************************\n"
" This is Free Software - You can use and distribute it under \n"
" the terms of the GNU General Public License, version 3 or later\n\n"
" Please visit http://www.complex-networks.net for more information\n\n"
" (c) Vincenzo Nicosia 2010-2017 (v.nicosia@qmul.ac.uk)\n"
"********************************************************************\n\n"
);
printf("Usage: %s <graph_in> <node>\n\n" , argv[0]);
}
/*
* Add 'k' to a list of predecessors
*/
void add_predecessor(unsigned int **pred, unsigned int k){
(*pred)[0] += 1;
*pred = realloc(*pred, ((*pred)[0] + 1) * sizeof(unsigned int));
(*pred)[ (*pred)[0] ] = k;
}
/*
*
* This is the implementation of the Breadth-First Search algorithm
* (BFS) to compute the shortest paths, and the distances, between a
* given node 'i' and all the other nodes of a graph.
*
*/
unsigned int** compute_shortest_paths(unsigned int N, unsigned int *J_slap, unsigned int *r_slap,
unsigned int i, unsigned int **dist){
unsigned int j, k, cur_node;
unsigned int *marked, **preds;
unsigned int d;
unsigned int n, nd, ndp;
*dist = malloc(N * sizeof(unsigned int));
marked = malloc(N * sizeof(unsigned int));
preds = malloc(N * sizeof(unsigned int *));
for(j=0; j<N; j ++){
(*dist)[j] = N;
preds[j] = malloc(sizeof(unsigned int));
preds[j][0] = 0; /* The list of predecessors is empty! */
}
(*dist)[i] = 0;
marked[0] = i;
d = 0;
n = 0;
nd = 1;
ndp = 0;
while (d<N && nd > 0){
for(k = n; k< n+nd; k ++){
cur_node = marked[k];
for (j=r_slap[cur_node]; j<r_slap[cur_node +1] ; j++){
if ( (*dist)[ J_slap[j] ] == d+1){
add_predecessor((unsigned int **)(preds + J_slap[j]), cur_node);
}
if ( (*dist)[ J_slap[j] ] == N){
(*dist)[ J_slap[j] ] = d+1;
marked[n + nd + ndp] = J_slap[j];
add_predecessor(preds + J_slap[j], cur_node);
ndp +=1;
}
}
}
n = n + nd;
nd = ndp;
ndp = 0;
d += 1;
}
free(marked);
return preds;
}
void dump_avg_max_hist(unsigned int *dists, unsigned int N){
unsigned int i;
double res = 0;
double max = 0;
double *hist;
for (i=0; i<N; i++){
res += dists[i];
if (dists[i] > max)
max = dists[i];
}
hist = malloc((max + 1) * sizeof(double));
for (i=0; i<=max; i++){
hist[i] = 0;
}
for (i=0; i<N; i++){
if(dists[i]){
hist[dists[i]] ++;
}
}
res = res/(N-1);
printf("%g %g", res, max);
for (i=1; i<=max; i++){
printf(" %g", hist[i]);
}
printf("\n");
free(hist);
}
int main(int argc, char *argv[]){
unsigned int *J_slap=NULL, *r_slap=NULL;
unsigned int K, N, i;
unsigned int **preds, *dists=NULL;
FILE *filein;
if (argc < 3){
usage(argv);
exit(1);
}
if (!strcmp(argv[1], "-")){
/* take the input from STDIN */
filein = stdin;
}
else {
filein = openfile_or_exit(argv[1], "r", 2);
}
read_slap(filein, &K, &N, &J_slap, &r_slap);
fclose(filein);
i = atoi(argv[2]);
if (i>N){
printf("Node id '%d' does not exist!!!! Exiting....\n", i);
exit(3);
}
preds = compute_shortest_paths(N, J_slap, r_slap, i, &dists);
dump_avg_max_hist(dists, N);
/* Cleanup */
for (i=0; i<N; i++){
free(preds[i]);
}
free(preds);
free(dists);
free(J_slap);
free(r_slap);
}
|
