ass2/testCentralityMeasures.c at master · COMP2521/ass2 · GitHub

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
/*
 * testCentralityMeasures.c
 * Written By Zain Afzal for cs2521 2018 s1
 *
 * Includes basic interface to read a graph in from
 * a file and a measure and calls the related functions
 *
 * Feel free to override this with your own tests if
 * you so wish.
 */
#include "CentralityMeasures.h"
#include "GraphVis.h"
#ifndef GRAPH
	#define GRAPH
	#include "Graph.h"
#endif
#include <stdlib.h>
#include <stdio.h>
#define BUFF_SIZE 1024

Graph readGraph(char* file) {
	// ugly count
	FILE * f = fopen(file , "r");
	if(!f){
		fprintf(stderr, "ERROR READING FILE %s\n", file);
		return NULL;
	}
	int lines = 0;
	char ch = 0;
	while(!feof(f)){ch = fgetc(f); if(ch == '\n')lines++;}
	fclose(f);

	//ugly parse
	f = fopen(file , "r");
	if(!f){
		fprintf(stderr, "ERROR READING FILE %s\n", file);
		return NULL;
	}
	int a=0;
	int b=0;
	int c=0;
	int i = 0;
	int maxVert = -1;
	int **nums = malloc(sizeof(int*)*lines);
	for(i=0;i<lines;i++) nums[i] = malloc(sizeof(int)*3);
	i=0;
	while(i < lines) {
		fscanf(f, "%d,", &a);
		fscanf(f, "%d,", &b);
		fscanf(f, "%d", &c);
		if (a > maxVert) maxVert = a;
		if (b > maxVert) maxVert = b;
		nums[i][0] = a;
		nums[i][1] = b;
		nums[i][2] = c;
		i++;
	}
	fclose(f);

	Graph g = newGraph(maxVert);
	i = 0;
	while(i < lines) {
		insertEdge(g,nums[i][0],nums[i][1],nums[i][2]);
		i++;
	}
	for(i=0;i<lines;i++) free(nums[i]);
	free(nums);
	return g;
}

void printUsage(){
	printf("Usage: ./testCentralityMeasures [file] [flag]\n");
	printf("Valid Flags:\n");
	printf("    d    : degree centrality\n");
	printf("    do   : degree out centrality\n");
	printf("    di   : degree in centrality\n");
	printf("    c    : closeness centrality\n");
	printf("    b    : betweenness centrality\n");
	printf("    bn   : betweenness centrality normalised\n");
	printf("    v[m] : trigger Graph Vis with mode [m]\n");
	printf("Valid Graph Vis Modes:\n");
	printf("    0    : DEFAULT\n");
	printf("    1    : DEGREE_IN\n");
	printf("    2    : DEGREE_OUT\n");
	printf("    3    : DEGREE\n");
	printf("    4    : CLOSENESS\n");
	printf("    5    : BETWEENNESS\n");
}

int main(int argc, char* argv[]){
	if (argc < 3) {
		printUsage();
		return EXIT_FAILURE;
	}
	Graph g = readGraph(argv[1]);
	printf("HASN'T BEEN IMPLEMENTED\n");
	if (argv[2][0] == 'd' && argv[2][1] == '\0') {
  	NodeValues val = degreeCentrality(g);
  	showNodeValues(val);
  	freeNodeValues(val);
	} else if (argv[2][0] == 'd' && argv[2][1] == 'i') {
  	NodeValues val = inDegreeCentrality(g);
  	showNodeValues(val);
  	freeNodeValues(val);
	} else if (argv[2][0] == 'c' && argv[2][1] == '\0') {
  	NodeValues val = closenessCentrality(g);
  	showNodeValues(val);
  	freeNodeValues(val);
	} else if (argv[2][0] == 'b' && argv[2][1] == '\0') {
  	NodeValues val = betweennessCentrality(g);
  	showNodeValues(val);
  	freeNodeValues(val);
	} else if (argv[2][0] == 'd' && argv[2][1] == 'o') {
  	NodeValues val = outDegreeCentrality(g);
  	showNodeValues(val);
  	freeNodeValues(val);
	} else if (argv[2][0] == 'b' && argv[2][1] == 'n') {
  	NodeValues val = betweennessCentralityNormalised(g);
  	showNodeValues(val);
  	freeNodeValues(val);
	} else if (argv[2][0] == 'v') {
			graphVis(g, argv[2][1]-'0');
	} else {
		printUsage();
	}
	freeGraph(g);
}