You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
66 lines
1.5 KiB
66 lines
1.5 KiB
/*
|
|
* This file is part of MAMMULT: Metrics And Models for Multilayer Networks
|
|
*
|
|
* 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/>.
|
|
*/
|
|
/**
|
|
*
|
|
* Get the degree distributions of two layers and a pairing, and dump
|
|
* on output the pairs k-q
|
|
*
|
|
*
|
|
*/
|
|
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
|
|
void dump_k_q(double *R1, double *R2, int N, int *pairing){
|
|
|
|
int i;
|
|
|
|
for (i=0; i<N; i++){
|
|
printf("%g %g\n", R1[i], R2[pairing[i]]);
|
|
}
|
|
}
|
|
|
|
|
|
int main(int argc, char *argv[]){
|
|
|
|
int N1, N2;
|
|
double *R1 = NULL;
|
|
double *R2 = NULL;
|
|
|
|
int *pairing = NULL;
|
|
|
|
|
|
if (argc < 4){
|
|
printf("Usage: %s <degs1> <degs2> <pairing>\n", argv[0]);
|
|
exit(1);
|
|
}
|
|
|
|
load_ranking(argv[1], &N1, &R1);
|
|
load_ranking(argv[2], &N2, &R2);
|
|
|
|
if (N1 != N2){
|
|
printf("Error!!!! The two files must have the same number of lines!!!! Exiting...\n");
|
|
exit(1);
|
|
}
|
|
|
|
pairing = malloc(N1 * sizeof(int));
|
|
|
|
load_pairing(&pairing, N1, argv[3]);
|
|
|
|
dump_k_q(R1, R2, N1, pairing);
|
|
|
|
}
|
|
|