CommunityDetectionCodes/Algorithms/2011-GCE/src-refactor/algorithm/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
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
/*
 * Community_Finder.h
 *
 *  Created on: 04-Dec-2009
 *      Author: freid
 */

#ifndef COMMUNITY_FINDER_H_
#define COMMUNITY_FINDER_H_

#include <time.h>

#include <iostream>
#include <map>
#include <algorithm>

#include "../util/graph/graph_representation.hpp"
#include "../util/graph/graph_loading.hpp"
#include "cliques.hpp"
#include "seed.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_ */