CommunityDetectionCodes/Algorithms/2011-GCE/src-original/Community_Finder.h at master · RapidsAtHKUST/CommunityDetectionCodes · 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
/*
 * Community_Finder.h
 *
 *  Created on: 04-Dec-2009
 *      Author: freid
 */

#ifndef COMMUNITY_FINDER_H_
#define COMMUNITY_FINDER_H_
#include <iostream>
#include <map>
#include <algorithm>
#include "graph_representation.hpp"
#include "graph_loading.hpp"
#include "cliques.hpp"
#include "Seed.h"
#include <time.h>

using namespace std;

//global graph
extern SimpleIntGraph theGlobalGraph;

extern vector< set<Seed*> > nodeToSeeds;

class Community_Finder {

private:
	void initialiseSeeds(const char * filename, int minimumCliqueSize);

public:
	static float minimumOverlapToMerge;
	static float numberOfTimesRequiredToBeSpokenFor;
	static float spokenForThresholdOfUniqueness;

	vector< vector<V> > cliques;

	int removeOverlappingFast();
	int removeOverlapping();
	vector< Seed* > seeds;
	void rawPrint();
	void printSeeds();
	void refreshAllSeedInternalCaches();
	void run();
	void operator () (const vector<V> & clique);
	Community_Finder(const char * filename, int minimumCliqueSize, float minimumOverlapToMerge, float alphaValueForFitness, float numberOfTimesRequiredToBeSpokenFor, float spokenForThresholdOfUniqueness);
	virtual ~Community_Finder();
	void sweepTheDead();
	void doSpokenForPruning();


};

#endif /* COMMUNITY_FINDER_H_ */