/
greedy_clique.cc
167 lines (155 loc) · 5.32 KB
/
greedy_clique.cc
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
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
/***********************************************************************
!! greedy_clique.cc contains the implementation of basic greedy !!
!! algorithms for maximum weight clique finding. !!
!! !!
!! Copyright (c) Stanislav Busygin, 2001-2007. All rights reserved. !!
!! !!
***********************************************************************/
#include <stdlib.h>
#include <algorithm>
#include "comp_double.h"
#include "greedy_clique.h"
void neighborhood_weights(Graph& g, double* vert_weights, double* neigh_weights) {
int& n=g.n;
memcpy(neigh_weights,vert_weights,sizeof(double)*n);
int i,j;
for(i=0;i<n;i++) {
bit_iterator bi(g.mates[i]);
while((j=bi.next())>-1) {
if(j>i) break;
neigh_weights[i] += vert_weights[j];
neigh_weights[j] += vert_weights[i];
}
}
}
void clear_act_verts (
Graph& g, vector<int>& act_verts, double* vert_weights,
double* neigh_weights, int sel_vert
) {
vector<bool_vector>::iterator bi = g.mates.begin() + sel_vert;
vector<int>::iterator ii;
for(ii=act_verts.end()-1;ii>=act_verts.begin();ii--) {
int i = *ii;
if(!bi->at(i)) {
act_verts.erase(ii);
vector<bool_vector>::iterator bj = g.mates.begin()+i;
for(vector<int>::iterator jj=act_verts.begin();jj<act_verts.end();jj++) {
int j = *jj;
if(bj->at(j)) neigh_weights[j] -= vert_weights[i];
}
}
}
}
int greedy_choice (
Graph& g, vector<int>& act_verts, double* vert_weights, double* neigh_weights
) {
if(act_verts.empty()) return -1;
vector<int>::iterator i_sel_vert = max_element (
act_verts.begin(), act_verts.end(), less_double(neigh_weights)
);
int sel_vert = *i_sel_vert;
act_verts.erase(i_sel_vert);
clear_act_verts(g, act_verts, vert_weights, neigh_weights, sel_vert);
return sel_vert;
}
void greedy_clique (
Graph& g, vector<int> act_verts, double* vert_weights,
double* neigh_weights, list<int>& clique
) {
double* neigh_weights1 = new double[g.n];
memcpy(neigh_weights1,neigh_weights,sizeof(double)*g.n);
int i;
while((i=greedy_choice(g,act_verts,vert_weights,neigh_weights1)) != -1)
clique.push_back(i);
delete[] neigh_weights1;
}
bool meta_greedy_clique(MaxCliqueInfo& graph_info) {
int& n = graph_info.g.n;
double* neigh_weights = new double[n];
neighborhood_weights(graph_info.g,&(graph_info.g.weights[0]),neigh_weights);
vector<int> act_verts;
double* neigh_weights1 = new double[n];
list<int> clique;
bool result = false;
for(int i=0;i<n;i++) {
memcpy(neigh_weights1,neigh_weights,sizeof(double)*n);
clique.clear();
act_verts.resize(n-1);
vector<int>::iterator jj = act_verts.begin();
int j;
for(j=0;j<n;j++) if(i!=j) *(jj++) = j;
clear_act_verts(graph_info.g,act_verts,&(graph_info.g.weights[0]),neigh_weights1,i);
clique.push_back(i);
while((j=greedy_choice(graph_info.g,act_verts,&(graph_info.g.weights[0]),neigh_weights1)) != -1)
clique.push_back(j);
result |= graph_info.receive_clique(clique);
}
delete[] neigh_weights;
delete[] neigh_weights1;
return result;
}
extern "C" double dot_product(int,double*,double*);
void neighborhood_weights (
MaxCliqueInfo& graph_info, double* a, double* neigh_weights
) {
int& n = graph_info.g.n;
for(int i=0;i<n;i++)
neigh_weights[i] = dot_product(n,graph_info.sqrtw,a+(i*n))/graph_info.sqrtw[i];
}
void clear_act_verts (
MaxCliqueInfo& graph_info, vector<int>& act_verts, double* a,
double* neigh_weights, int sel_vert
) {
vector<bool_vector>::iterator bi = graph_info.g.mates.begin() + sel_vert;
vector<int>::iterator ii;
for(ii=act_verts.end()-1;ii>=act_verts.begin();ii--) {
int i = *ii;
if(!bi->at(i)) {
act_verts.erase(ii);
// vector<bool_vector>::iterator bj = graph_info.g.mates.begin()+i;
for(vector<int>::iterator jj=act_verts.begin();jj<act_verts.end();jj++) {
int j = *jj;
neigh_weights[j] -=
graph_info.sqrtw[j]*a[i*graph_info.g.n+j]/graph_info.sqrtw[i];
}
}
}
}
int greedy_choice (
MaxCliqueInfo& graph_info, vector<int>& act_verts, double* a,
double* neigh_weights
) {
if(act_verts.empty()) return -1;
vector<int>::iterator i_sel_vert = max_element (
act_verts.begin(), act_verts.end(), less_double(neigh_weights)
);
int sel_vert = *i_sel_vert;
act_verts.erase(i_sel_vert);
clear_act_verts(graph_info, act_verts, a, neigh_weights, sel_vert);
return sel_vert;
}
bool meta_greedy_clique(MaxCliqueInfo& graph_info, double* a) {
int& n = graph_info.g.n;
double* neigh_weights = new double[n];
neighborhood_weights(graph_info,a,neigh_weights);
vector<int> act_verts;
double* neigh_weights1 = new double[n];
list<int> clique;
bool result = false;
for(int i=0;i<n;i++) {
memcpy(neigh_weights1,neigh_weights,sizeof(double)*n);
clique.clear();
act_verts.resize(n-1);
vector<int>::iterator jj = act_verts.begin();
int j;
for(j=0;j<n;j++) if(i!=j) *(jj++) = j;
clear_act_verts(graph_info.g,act_verts,a,neigh_weights1,i);
clique.push_back(i);
while((j=greedy_choice(graph_info,act_verts,a,neigh_weights1)) != -1)
clique.push_back(j);
result |= graph_info.receive_clique(clique);
}
delete[] neigh_weights;
delete[] neigh_weights1;
return result;
}