-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathvertexSubset.h
158 lines (142 loc) · 4.54 KB
/
vertexSubset.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
/**
* The MIT License (MIT)
*
* Copyright (c) 2015 Yichao Cheng
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
* THE SOFTWARE.
*/
/**
* Vertex Subset
*
* Author: Yichao Cheng ([email protected])
* Created on: 2015-03-04
* Last Modified: 2015-03-04
*/
#ifndef VERTEX_SUBSET_H
#define VERTEX_SUBSET_H
class VertexSubset {
public:
/**
* VertexSubset has two representations, which can convert to each other.
* The sparse representation uses a bitmap to represent the working set.
* The dense one uses a queue.
*/
GRD<int> workset;
GRD<VertexId> workqueue;
VertexId *qSize;
VertexId *qSizeDevice;
bool isDense;
/** Make empty subset */
VertexSubset() : qSize(NULL), qSizeDevice(NULL), isDense(false) {}
/**
* Make a sparse vertex subset of n vertices.
* @param n The size of the set
* @param universal Indicating the set is empty or universal
*/
VertexSubset(VertexId n, bool universal) {
isDense = false;
workset.reserve(n);
if (universal) {
workset.allTo(1);
} else {
workset.allTo(0);
}
}
/**
* Make a dense vertex subset of no vertex inside.
* @param n The size of the set
*/
VertexSubset(VertexId n) {
isDense = true;
workqueue.reserve(n);
qSize = (VertexId *) malloc(sizeof(VertexId));
*qSize = 0;
CUDA_CHECK(cudaMalloc((void **) &qSizeDevice, sizeof(VertexId)));
CUDA_CHECK(H2D(qSizeDevice, qSize, sizeof(VertexId)));
}
/**
* Make a dense vertex subset of a singleton vertex in range of n.
* @param n The size of the set
* @param v The singleton vertex
*/
VertexSubset(VertexId n, VertexId v) {
isDense = true;
workqueue.reserve(n);
workqueue.set(0, v); // push v
qSize = (VertexId *) malloc(sizeof(VertexId));
*qSize = 1;
CUDA_CHECK(cudaMalloc((void **) &qSizeDevice, sizeof(VertexId)));
CUDA_CHECK(H2D(qSizeDevice, qSize, sizeof(VertexId)));
}
/**
* Transfer all the `workqueueSize` back and sum them up.
*/
inline VertexId size() const {
if (isDense) {
CUDA_CHECK(D2H(qSize, qSizeDevice, sizeof(VertexId)));
return *qSize;
} else {
assert(0);
}
}
inline VertexId capacity() const {
return isDense ? workqueue.capacity() : workset.capacity();
}
inline void clear() {
if (isDense) {
*qSize = 0;
CUDA_CHECK(H2D(qSizeDevice, qSize, sizeof(VertexId)));
} else {
workset.clear();
}
}
inline void print() {
if (isDense) {
CUDA_CHECK(D2H(qSize, qSizeDevice, sizeof(VertexId)));
workqueue.persist();
printf("dense: ");
for (int i = 0; i < *qSize; i++) {
printf("%d ", workqueue[i]);
}
printf("\n");
} else {
workset.persist();
printf("sparse: ");
for (int i = 0; i < workset.capacity(); i++) {
if (workset[i] == 1) {
printf("%d ", i);
}
}
printf("\n");
}
}
void del() {
if (isDense) {
workqueue.del();
if (qSize) free(qSize);
if (qSizeDevice) cudaFree(qSizeDevice);
} else {
workset.del();
}
}
// ~VertexSubset() {
// del();
// }
};
#endif // VERTEX_SUBSET_H