/**
* 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
* .
*
* (c) Vincenzo Nicosia 2009-2017 --
*
* 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
#include
#include
#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 \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 0){
for(k = n; k< n+nd; k ++){
cur_node = marked[k];
for (j=r_slap[cur_node]; j max)
max = dists[i];
}
hist = malloc((max + 1) * sizeof(double));
for (i=0; i<=max; i++){
hist[i] = 0;
}
for (i=0; iN){
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