Repository navigation
Expand file tree
/
Copy pathlevelgraph.hpp
More file actions
280 lines (198 loc) · 6.43 KB
/
Copy pathlevelgraph.hpp
File metadata and controls
280 lines (198 loc) · 6.43 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
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
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
#ifndef _LEVEL_GRAPH_HPP
#define _LEVEL_GRAPH_HPP
#include <iostream>
#include <string>
#include <array>
#include <vector>
#include <random>
#include <algorithm>
#include <iterator>
#include <tuple>
#include <chrono>
#include <cmath>
#include <memory>
#include <unordered_set>
#include <ctime>
#include <cstdlib>
#include <taskflow/taskflow.hpp>
#include <tbb/task_scheduler_init.h>
#include <tbb/flow_graph.h>
class LevelGraph;
class Node{
public:
Node(LevelGraph& graph, bool chosen, size_t level, int index, std::vector<int>& next_level_nodes)
: _graph(graph), _chosen(chosen), _level(level), _idx(index) {
_out_edges = std::move(next_level_nodes);
}
//void mark(){
// _visited = true;
//}
inline void mark();
void unmark(){
_visited = false;
}
bool check_status() {
return _visited;
}
void print_node(){
std::cout << "Node: " << _idx << " out_edges: ";
for(const auto& out_edge: _out_edges){
std::cout << out_edge << "\t";
}
std::cout << "\n" << "in_edges";
for(const auto& in_edge: _in_edges){
std::cout << "(" << in_edge.first << "," << in_edge.second << ")\t";
}
std::cout << "Status:" << _visited << std::endl;
std::cout << std::endl;
}
int index() const { return _idx; }
int level() const { return _level; }
int* edge_ptr(int edge_idx) { return &_out_edges[edge_idx]; }
std::vector<std::pair<int, int>> _in_edges;
std::vector<int> _out_edges;
private:
LevelGraph& _graph;
bool _chosen {false};
size_t _level;
int _idx;
bool _visited {false};
};
class LevelGraph {
public:
LevelGraph(size_t length, size_t level, float threshold = 0.0f){
_level_num = level;
_length_num = length;
std::mt19937 g(0); // fixed the seed for graph generator
std::srand(0);
for(size_t l=0; l<level; ++l){
std::vector<Node> cur_nodes;
std::vector<int> next_level_nodes;
for(size_t i=0; i<length; i++){
next_level_nodes.push_back(i);
}
//shuffle nodes in the next level
std::shuffle(next_level_nodes.begin(), next_level_nodes.end(), g);
size_t edge_num = 1;
size_t start = 0, end = 0;
bool re_shuffle = false;
for(size_t i=0; i<length; i++){
edge_num = 1 + (std::rand() % _edge_max);
if(start + edge_num >= length){
end = length;
re_shuffle = true;
}
else{
end = start + edge_num;
}
//std::cout << "Level\t" << l << "\tidx\t" << i << "\tedge_num\t" << edge_num << "\tstart\t" << start << "\tend\t" << end << std::endl;
std::vector<int> edges(next_level_nodes.begin()+start, next_level_nodes.begin()+end);
//choose a node to do some work
float rv = std::rand()/(RAND_MAX + 1u);
bool chosen = false;
if(rv < threshold){
chosen = true;
}
cur_nodes.emplace_back(*this, chosen, l, i, edges); //create nodes
if(re_shuffle){
std::shuffle(next_level_nodes.begin(), next_level_nodes.end(), g);
start = 0;
re_shuffle = false;
}
else{
start = end;
}
}
_graph.push_back(std::move(cur_nodes));
}
for(size_t l=0; level > 0 && l<level-1; ++l){
for(size_t i=0; i<length; ++i){
for(size_t j=0; j<_graph[l][i]._out_edges.size(); ++j){
int src_idx = _graph[l][i].index();
int dest_idx = _graph[l][i]._out_edges[j];
_graph[l+1][dest_idx]._in_edges.push_back(std::make_pair(src_idx, j));
}
}
}
//print_graph();
}
void print_graph(){
for(size_t l=0; l<_graph.size(); l++){
std::cout << "-----------Level " << l <<"----------" << std::endl;
for(size_t i=0; i<_graph[l].size(); i++){
_graph[l][i].print_node();
}
}
}
bool validate_result(){
for(size_t l=0; l<_level_num; l++){
for(size_t i=0; i<_length_num; i++){
if(_graph[l][i].check_status() == false){
std::cout << "Level:\t" << l << "\tidx\t" << i << "\tnot visited" << std::endl;
return false;
}
}
}
return true;
}
void clear_graph(){
for(size_t l=0; l<_level_num; l++){
for(size_t i=0; i<_length_num; i++){
_graph[l][i].unmark();
}
}
}
Node& node_at(size_t level, size_t index){ return _graph[level][index]; }
size_t level(){ return _level_num; }
size_t length() { return _length_num; }
size_t graph_size() const {
size_t size = 0;
for(const auto& nodes : _graph) {
for(const auto& node : nodes) {
size++;
size+=node._out_edges.size();
}
}
return size;
}
//backward BFS given a destinatio node
void BFS(const Node& dst){
std::unordered_set<int> idx_list;
std::queue<int> idx_queue;
int dst_idx = dst.level()*_length_num + dst.index();
idx_queue.push(dst_idx);
idx_list.insert(dst_idx);
while(!idx_queue.empty()){
int child = idx_queue.front();
int child_level = child / _length_num;
int child_index = child % _length_num;
//std::cout << "Node level: " << child_level << " idx: " << child_index << std::endl;
idx_queue.pop();
const Node& n = _graph[child_level][child_index];
for(size_t i=0; child_level>0 && i<n._in_edges.size(); i++){
int parent_level = child_level-1;
int parent_index = n._in_edges[i].first;
int parent = parent_level*_length_num + parent_index;
if(idx_list.find(parent) == idx_list.end()){
idx_queue.push(parent);
idx_list.insert(parent);
}
}
}
}
private:
const size_t _edge_max = 4;
size_t _level_num;
size_t _length_num;
std::vector<std::vector<Node>> _graph;
};
inline void Node::mark(){
_visited = true;
if(_chosen == true){
_graph.BFS(*this);
}
}
std::chrono::microseconds measure_time_taskflow(LevelGraph&, unsigned);
std::chrono::microseconds measure_time_omp(LevelGraph&, unsigned);
std::chrono::microseconds measure_time_tbb(LevelGraph&, unsigned);
#endif