-
Notifications
You must be signed in to change notification settings - Fork 4
/
Graph.h
238 lines (213 loc) · 7.67 KB
/
Graph.h
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
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
#ifndef __GRAPH_H__
#define __GRAPH_H__
#include "Meta.h"
#include "TimeMeasurer.h"
#include <string>
#include <cstring>
#include <cassert>
#include <fstream>
#include <map>
#include <algorithm>
#include <vector>
#include <cstdio>
class Graph{
public:
Graph(const std::string &filename, bool directed, bool is_window){
this->directed = directed;
this->filename = filename;
// read our .bin file
if (is_window){
ReadWindowGraph();
}
else{
ReadFile();
}
}
Graph(){}
void ReadWindowGraph(){
std::cout << "read window graph filename=" << filename << std::endl;
TimeMeasurer timer;
timer.StartTimer();
FILE* file_in = NULL;
size_t file_pos, file_size, res_size;
file_in = fopen(filename.c_str(), "rb");
assert(file_in != NULL);
fseek(file_in, 0L, SEEK_END);
file_size = ftell(file_in);
rewind(file_in);
res_size = fread(&vertex_count, sizeof(IndexType), 1, file_in);
assert(res_size == 1);
file_pos = sizeof(IndexType);
std::cout << "vertex_count=" << vertex_count << std::endl;
deg = new IndexType[vertex_count];
in_deg = new IndexType[vertex_count];
memset(deg, 0, sizeof(IndexType) * vertex_count);
memset(in_deg, 0, sizeof(IndexType) * vertex_count);
assert((file_size - file_pos) % 2 == 0);
size_t edge_num = (file_size - file_pos) / (2 * sizeof(IndexType));
size_t read_edge_num = edge_num * gWindowRatio;
size_t read_file_size = read_edge_num * 2 * sizeof(IndexType) + file_pos;
res_size = 0;
IndexType v1, v2;
while (file_pos < read_file_size){
res_size += fread(&v1, sizeof(IndexType), 1, file_in);
res_size += fread(&v2, sizeof(IndexType), 1, file_in);
assert(0 <= v1 && v1 < vertex_count);
assert(0 <= v2 && v2 < vertex_count);
deg[v1]++;
in_deg[v2]++;
if (!directed){
deg[v2]++;
in_deg[v1]++;
}
file_pos += sizeof(IndexType) * 2;
}
assert(file_pos == read_file_size);
assert(res_size * sizeof(IndexType) == read_file_size - sizeof(IndexType));
std::cout << "edge_num=" << edge_num << ",read_edge_num=" << read_edge_num << ",read_file_size=" << read_file_size << std::endl;
fclose(file_in);
timer.EndTimer();
std::cout << "read file elapsed time=" << timer.GetElapsedMicroSeconds() / 1000.0 << "ms" << std::endl;
}
void ReadFile(){
std::cout << "readfile filename=" << filename << std::endl;
TimeMeasurer timer;
timer.StartTimer();
FILE* file_in = NULL;
size_t file_pos, file_size, res_size;
file_in = fopen(filename.c_str(), "rb");
assert(file_in != NULL);
fseek(file_in, 0L, SEEK_END);
file_size = ftell(file_in);
rewind(file_in);
res_size = fread(&vertex_count, sizeof(IndexType), 1, file_in);
assert(res_size == 1);
file_pos = sizeof(IndexType);
std::cout << "vertex_count=" << vertex_count << std::endl;
deg = new IndexType[vertex_count];
in_deg = new IndexType[vertex_count];
memset(deg, 0, sizeof(IndexType) * vertex_count);
memset(in_deg, 0, sizeof(IndexType) * vertex_count);
res_size = 0;
IndexType v1, v2;
while (file_pos < file_size){
res_size += fread(&v1, sizeof(IndexType), 1, file_in);
res_size += fread(&v2, sizeof(IndexType), 1, file_in);
assert(0 <= v1 && v1 < vertex_count);
assert(0 <= v2 && v2 < vertex_count);
deg[v1]++;
in_deg[v2]++;
if (!directed){
deg[v2]++;
in_deg[v1]++;
}
file_pos += sizeof(IndexType) * 2;
}
assert(file_pos == file_size);
assert(res_size * sizeof(IndexType) == file_size - sizeof(IndexType));
fclose(file_in);
timer.EndTimer();
std::cout << "read file elapsed time=" << timer.GetElapsedMicroSeconds() / 1000.0 << "ms" << std::endl;
}
// workload
void WriteVertexIdToFile(IndexType *ids, const size_t num, std::string &write_file_name){
std::ofstream file(write_file_name.c_str());
assert(file.good());
for (size_t i = 0; i < num; ++i){
file << ids[i] << std::endl;
}
file.close();
}
virtual IndexType UniformChooseVertex(){
return rand() % vertex_count;
}
virtual void UniformChooseVertex(IndexType *ids, const size_t num){
for (size_t i = 0; i < num; ++i){
while (1){
IndexType u = rand() % vertex_count;
bool valid = true;
for (size_t j = 0; j < i; ++j){
if (ids[j] == u){
valid = false;
}
}
if (deg[u] == 0 || in_deg[u] == 0){
valid = false;
}
if (valid) {
ids[i] = u;
break;
}
}
}
for (size_t i = 0; i < num; ++i){
std::cout << ids[i] << ",deg=" << deg[ids[i]] << std::endl;
}
}
struct VDegFunctor{
IndexType *deg;
VDegFunctor(IndexType *d){
deg = d;
}
bool operator()(IndexType a, IndexType b){
return deg[a] > deg[b];
}
};
virtual void ChooseVertexDegreeRange(IndexType *ids, const size_t num, IndexType rank_st, IndexType rank_ed, const bool is_out_degree){
// randomly choose vertex with degree in the range of [rank_st, rank_ed)
// rank_st, rank_ed is 0-based
if (rank_ed > vertex_count) rank_ed = vertex_count;
IndexType *idx = new IndexType[vertex_count];
for (IndexType i = 0; i < vertex_count; ++i){
idx[i] = i;
}
IndexType *cmp_deg = is_out_degree ? deg : in_deg;
std::sort(idx, idx + vertex_count, VDegFunctor(cmp_deg));
std::cout << "finish sort" << std::endl;
for (IndexType i = 1; i < vertex_count; ++i) assert(cmp_deg[idx[i-1]] >= cmp_deg[idx[i]]);
assert(rank_ed - rank_st >= num);
assert(rank_ed <= vertex_count);
if (rank_ed - rank_st == num){
for (int i = 0; i < num; ++i){
IndexType p = rank_st + i;
IndexType u = idx[p];
ids[i] = u;
}
}
else{
for (IndexType i = 0; i < num; ++i){
while (1){
IndexType p = rand() % (rank_ed - rank_st) + rank_st;
IndexType u = idx[p];
bool valid = true;
for (IndexType j = 0; j < i; ++j){
if (ids[j] == u){
valid = false;
break;
}
}
// choose the connected ones
if (deg[u] == 0 || in_deg[u] == 0){
valid = false;
}
if (valid){
ids[i] = u;
break;
}
}
}
}
for (IndexType i = 0; i < num; ++i){
std::cout << "u=" << ids[i] << ",deg=" << deg[ids[i]] << ",in_deg=" << in_deg[ids[i]] << std::endl;
}
delete[] idx;
idx = NULL;
}
public:
std::string filename;
bool directed;
IndexType vertex_count;
IndexType *deg;
IndexType *in_deg;
};
#endif