-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathKPTreeUtils.cpp
More file actions
203 lines (144 loc) · 6.47 KB
/
KPTreeUtils.cpp
File metadata and controls
203 lines (144 loc) · 6.47 KB
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
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
//
// Created by ldd on 2022/10/14.
//
#include "KPTreeUtils.h"
string KPTreeUtils::GetPTreeFilePref(P_tree_f2i &p_tree_f2i) {
return GetPTreeFilePref(p_tree_f2i.dataset, p_tree_f2i.k, p_tree_f2i.builder);
}
string KPTreeUtils::GetKPTreeFilePref(KP_tree_f2i &kp_tree_f2i) {
if (kp_tree_f2i.sampled_k_size) {
return GetKPTreeFilePref(kp_tree_f2i.dataset, kp_tree_f2i.sampled_k_size, kp_tree_f2i.builder);
} else {
return GetKPTreeFilePref(kp_tree_f2i.dataset, kp_tree_f2i.builder, kp_tree_f2i.step, kp_tree_f2i.ini_k);
}
}
void KPTreeUtils::BuildPTree(MultilayerGraph &mg, vector<int> &k, p_tree_builder builder, const string &path) {
long long int num_of_nodes;
string p_tree_file_prefix = path + GetPTreeFilePref(mg.GetGraphName(), k, builder);
Timer timer;
int dim = mg.GetLayerNumber() - 1;
PTree p_tree(dim);
Frac2IntPri f2i(dim);
PTreeBuilder p_tree_builder(mg);
p_tree_builder.Execute(k, p_tree, f2i, builder);
timer.Stop();
// write to file
p_tree.Flush(p_tree_file_prefix + "_p_tree");
f2i.Flush(p_tree_file_prefix + "_f2i");
// output
num_of_nodes = p_tree.GetNumOfNodes();
auto f = std::ofstream(p_tree_file_prefix + "_info");
f << "construction_time = " << timer.GetTimeInMs() << endl;
f << "#nodes = " << num_of_nodes << endl;
f.close();
cout << "PTree has been constructed in " << timer.GetTimeInMs() << "ms, with total " << num_of_nodes
<< " nodes generated." << endl;
}
void KPTreeUtils::BuildKPTree(MultilayerGraph &mg, p_tree_builder builder, const string &path, int step,
const vector<int> &start_k) {
long long int num_of_nodes;
string file_name_prefix = path + GetKPTreeFilePref(mg.GetGraphName(), builder, step, start_k);
Timer timer;
int ln = mg.GetLayerNumber();
KPTree kp_tree(ln);
Frac2IntPri f2i(ln - 1);
KPTreeBuilder kp_tree_builder(mg);
kp_tree_builder.Execute(kp_tree, f2i, builder, step, start_k);
timer.Stop();
// write to file
kp_tree.Flush(file_name_prefix + "_kp_tree");
f2i.Flush(file_name_prefix + "_f2i");
// output
num_of_nodes = kp_tree.GetNumOfPNodes();
auto f = std::ofstream(file_name_prefix + "_info");
f << "construction_time = " << timer.GetTimeInMs() << endl;
f << "#nodes = " << num_of_nodes << endl;
f.close();
cout << "KPTree has been constructed in " << timer.GetTimeInMs() << "ms, with total " << num_of_nodes
<< " nodes generated." << endl;
}
void KPTreeUtils::BuildKPTree(MultilayerGraph &mg, const string &sampled_k_vec_file, p_tree_builder builder,
const string &path) {
long long int num_of_nodes;
vector<vector<int>> sampled_k_vec;
KPVecGenerator::LoadKVectors(mg.GetLayerNumber(), sampled_k_vec_file, sampled_k_vec);
string file_name_prefix = path + GetKPTreeFilePref(mg.GetGraphName(), (int) sampled_k_vec.size(), builder);
Timer timer;
int ln = mg.GetLayerNumber();
KPTree kp_tree(ln);
Frac2IntPri f2i(ln - 1);
KPTreeBuilder kp_tree_builder(mg);
kp_tree_builder.Execute(kp_tree, f2i, sampled_k_vec, builder);
timer.Stop();
// write to file
kp_tree.Flush(file_name_prefix + "_kp_tree");
f2i.Flush(file_name_prefix + "_f2i");
// output
num_of_nodes = kp_tree.GetNumOfPNodes();
auto f = std::ofstream(file_name_prefix + "_info");
f << "construction_time = " << timer.GetTimeInMs() << endl;
f << "#nodes = " << num_of_nodes << endl;
f.close();
cout << "KPTree has been constructed in " << timer.GetTimeInMs() << "ms, with total " << num_of_nodes
<< " nodes generated." << endl;
}
void KPTreeUtils::LoadPTree(string &p_tree_file, string &f2i_file, P_tree_f2i &p_tree_f2i) {
Timer timer;
p_tree_f2i.p_tree = PTree::Load(p_tree_file);
p_tree_f2i.f2i = Frac2IntPri::Load(f2i_file);
ParseTreeInfo(p_tree_file, p_tree_f2i);
timer.Stop();
cout << "PTree has been loaded in " << timer.GetTimeInMs() << "ms." << endl;
}
void KPTreeUtils::LoadKPTree(string &kp_tree_file, string &f2i_file, KP_tree_f2i &kp_tree_f2i) {
Timer timer;
kp_tree_f2i.kp_tree = KPTree::Load(kp_tree_file);
kp_tree_f2i.f2i = Frac2IntPri::Load(f2i_file);
ParseTreeInfo(kp_tree_file, kp_tree_f2i);
timer.Stop();
cout << "KPTree has been loaded in " << timer.GetTimeInMs() << "ms." << endl;
}
string KPTreeUtils::GetPTreeFilePref(const string &dataset, vector<int> &k, p_tree_builder builder) {
return dataset + "_" + Vec2String(k) + "_" + GetBuilderName(builder);
}
string KPTreeUtils::GetKPTreeFilePref(const string &dataset, p_tree_builder builder, int step, const vector<int> &start_k) {
return start_k.empty() ? (dataset + "_" + GetBuilderName(builder)) + "_" + to_string(step) :
(dataset + "_" + GetBuilderName(builder) + "_" + to_string(step) + "_" + Vec2String(start_k));
}
string KPTreeUtils::GetKPTreeFilePref(const string &dataset, int sampled_k_vector_size, p_tree_builder builder) {
return dataset + "_" + to_string(sampled_k_vector_size) + "_" + GetBuilderName(builder);
}
void KPTreeUtils::ParseTreeInfo(string &p_tree_file, P_tree_f2i &p_tree_f2i) {
vector<string> tokens;
Split(p_tree_file.substr((int) p_tree_file.find_last_of('/') + 1), tokens, false, '_');
p_tree_f2i.dataset = tokens[0];
String2Vec(tokens[1], p_tree_f2i.k);
p_tree_f2i.builder = GetBuilderMode(tokens[2]);
}
void KPTreeUtils::ParseTreeInfo(string &kp_tree_file, KP_tree_f2i &kp_tree_f2i) {
vector<string> tokens;
Split(kp_tree_file.substr((int) kp_tree_file.find_last_of('/') + 1), tokens, false, '_');
kp_tree_f2i.dataset = tokens[0];
try {
kp_tree_f2i.builder = GetBuilderMode(tokens[1]);
kp_tree_f2i.step = stoi(tokens[2]);
if (tokens[3].substr(0, 1) == "[") String2Vec(tokens[3], kp_tree_f2i.ini_k);
} catch (std::exception &e) {
kp_tree_f2i.sampled_k_size = stoi(tokens[1]);
kp_tree_f2i.builder = GetBuilderMode(tokens[2]);
}
}
p_tree_builder KPTreeUtils::GetBuilderMode(string &builder) {
if (builder == "naive") return NAIVE;
else if (builder == "ne") return NE;
else if (builder == "se") return SE;
else if (builder == "nese") return NESE;
else throw std::exception();
}
string KPTreeUtils::GetBuilderName(p_tree_builder builder) {
if (builder == NAIVE) return "naive";
else if (builder == NE) return "ne";
else if (builder == SE) return "se";
else if (builder == NESE) return "nese";
else exit(-1);
}