forked from dacapo1142/clustering-tools
-
Notifications
You must be signed in to change notification settings - Fork 0
/
label_propagation.cpp
74 lines (67 loc) · 2.09 KB
/
label_propagation.cpp
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
#include "clusters.hpp"
#include <iostream>
#include <map>
#include <random>
#include <set>
#include <vector>
using namespace std;
using namespace chrono;
int main(int argc, char *argv[]) {
default_random_engine generator;
const char *filename = argv[1];
ifstream file(filename);
unsigned n = atoi(argv[2]);
unsigned k = atoi(argv[3]);
unsigned total_k = n;
Clusters clusters(n, n, file);
bool changed = true;
bool not_reach = true;
vector<unsigned> iter_order(n);
for (unsigned vid = 0; vid < n; vid++) {
iter_order[vid] = vid;
}
shuffle(iter_order.begin(), iter_order.end(), generator);
while (changed && not_reach) {
changed = false;
for (auto &vid : iter_order) {
unsigned max_count = 0;
unsigned tie_count = 0;
map<unsigned, unsigned> m;
for (auto &vertex2 : clusters.adj_list[vid]) {
unsigned vid2 = vertex2.vid;
unsigned cid2 = clusters.sets.which_cluster[vid2];
m[cid2]++;
if (m[cid2] == max_count) {
tie_count++;
} else if (m[cid2] > max_count) {
tie_count = 1;
max_count = m[cid2];
}
}
vector<unsigned> v;
v.reserve(tie_count);
for (auto &pair : m) {
if (pair.second == max_count) {
v.push_back(pair.first);
}
}
uniform_int_distribution<int> distribution(0, tie_count - 1);
unsigned idx = distribution(generator);
unsigned new_cid = v[idx];
unsigned old_cid = clusters.sets.which_cluster[vid];
clusters.sets.move(vid, new_cid);
if (new_cid != old_cid) {
changed = true;
}
if (clusters.sets.size[old_cid] == 0) {
total_k--;
}
if (total_k <= k) {
not_reach = false;
break;
}
}
}
clusters.sets.print();
return 0;
}