-
Notifications
You must be signed in to change notification settings - Fork 0
/
tree.hpp
338 lines (280 loc) · 7.33 KB
/
tree.hpp
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
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
/**
* @file tree.hpp
* @author Arturo Blas Jiménez <arturoblas@gmail.com>
* @version 0.1
*
* @section LICENSE
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
* @section DESCRIPTION
*
* This header file provides a STL-like implementation
* for a tree data structure with specific iterators for
* BFS and DFS.
*
*/
#ifndef TREE_HPP_
#define TREE_HPP_
#include <list>
#include <algorithm>
#include <stack>
#include <queue>
#ifndef TREE_NAMESPACE__
#define TREE_NAMESPACE__ std
#endif
namespace TREE_NAMESPACE__
{
/**
* This defines the default container type
* that handles the list of children of a node
*/
template<class _Tp, class _Alloc = std::allocator<_Tp>, class container_type = std::list<_Tp, _Alloc> >
struct container_type_def
{
typedef container_type type; //< The container type!
};
template<typename _Tp, typename _Alloc = std::allocator<_Tp> >
class node: public container_type_def<node<_Tp, _Alloc>, _Alloc>::type
{
public:
typedef _Tp value_type;
typedef node<value_type, _Alloc> node_type;
typedef typename container_type_def<node_type, _Alloc>::type container_type;
typedef typename container_type::iterator child_iterator;
typedef typename container_type::reverse_iterator reverse_child_iterator;
typedef typename container_type::const_iterator const_child_iterator;
typedef typename container_type::const_reverse_iterator const_reverse_child_iterator;
typedef typename container_type::size_type size_type;
typedef typename container_type::allocator_type allocator_type;
node(const value_type& data) : data_(data) {}
node(const node_type& other) : container_type(other), data_(other.data_)
{
}
inline
const value_type& const_data() const
{
return data_;
}
inline
value_type& data()
{
return data_;
}
operator value_type()
{
return data();
}
operator const value_type() const
{
return const_data();
}
bool operator==(const node_type& other)
{
return data_ == other.data_;
}
bool operator==(const value_type& value)
{
return data_ == value;
}
// This iterator provides deep first search iteration capability
class dfs_iterator: public std::iterator<std::forward_iterator_tag, value_type>
{
private:
template<typename T, typename A> friend class node;
explicit dfs_iterator(node_type& root)
{
stack_.push(&root);
}
public:
dfs_iterator()
{
// This is used to create the dfs_end() iterator
}
dfs_iterator& operator++()
{
if (!stack_.empty())
{
node_type* n = stack_.top();
// Remove the item and put its children
stack_.pop();
reverse_child_iterator it = n->rbegin();
while (it != n->rend())
{
stack_.push(const_cast<node_type*>(&*it));
it++;
}
}
return *this;
}
node_type* operator->() const
{
if (!stack_.empty())
return stack_.top();
else
return 0;
}
node_type& operator*() const
{
return *stack_.top();
}
bool operator!=(const dfs_iterator& other) const
{
return this->operator ->() != other.operator ->();
}
bool operator==(const dfs_iterator& other) const
{
return !this->operator !=(other);
}
private:
std::stack<node_type*> stack_;
};
dfs_iterator dfs_begin()
{
return dfs_iterator(*this);
}
dfs_iterator dfs_end() const
{
return dfs_iterator();
}
// This iterator provides breath first search iteration capability
class bfs_iterator: public std::iterator<std::forward_iterator_tag, value_type>
{
private:
template<typename T, typename A> friend class node;
explicit bfs_iterator(const node_type& root)
{
queue_.push(const_cast<node_type*>(&root));
}
public:
bfs_iterator()
{
// This is used to create the end() iterator
}
bfs_iterator& operator++()
{
if (!queue_.empty())
{
node_type* n = queue_.front();
// Remove the item and put its children
queue_.pop();
child_iterator it = n->begin();
while (it != n->end())
{
queue_.push(const_cast<node_type*>(&*it));
it++;
}
}
return *this;
}
node_type* operator->() const
{
if (!queue_.empty())
return queue_.front();
else
return 0;
}
node_type& operator*() const
{
return *queue_.front();
}
bool operator!=(const bfs_iterator& other) const
{
return this->operator ->() != other.operator ->();
}
bool operator==(const bfs_iterator& other) const
{
return !this->operator !=(other);
}
private:
std::queue<node_type*> queue_;
};
bfs_iterator bfs_begin() const
{
return bfs_iterator(*this);
}
bfs_iterator bfs_end() const
{
return bfs_iterator();
}
/*bool contains(const value_type& data) const
{
return std::find(this->begin(), this->end(), data) != this->end();
}
bool contains_recursive(const value_type& data) const
{
return std::find(bfs_begin(), bfs_end(), data) != bfs_end();
}*/
size_type remove_recursive(const value_type& data)
{
size_type many = 0;
child_iterator it = this->begin();
while(it!=this->end())
{
many += it->remove_recursive(data);
it++;
}
size_type size = this->size();
this->remove(data);
many += size - this->size();
return many;
}
private:
value_type data_;
};
template<class _Tp, class _Alloc>
bool operator<(const node<_Tp, _Alloc>& a, const node<_Tp, _Alloc>& b)
{
return a.const_data() < b.const_data();
}
template<class _Tp, class _Alloc>
bool operator==(const node<_Tp, _Alloc>& a, const node<_Tp, _Alloc>& b)
{
return a.const_data() == b.const_data();
}
template<class _Tp, class _Alloc>
node<_Tp, _Alloc>& operator>>(node<_Tp, _Alloc>& a, node<_Tp, _Alloc>& b)
{
a.push_back(b);
return a.back();
}
template<class _Tp, class _Alloc>
node<_Tp, _Alloc>& operator>>(node<_Tp, _Alloc>& a, const _Tp& b)
{
a.push_back(b);
return a.back();
}
template<typename _Tp, typename _Alloc = std::allocator<_Tp> >
class tree: public node<_Tp, _Alloc>
{
public:
typedef node<_Tp, _Alloc> base_type;
typedef base_type node_type;
typedef typename base_type::value_type value_type;
tree(const value_type& data) : base_type(data) {}
};
template<typename _Tp, typename _Alloc = std::allocator<_Tp> >
class graph: public node<typename container_type_def<node<_Tp, _Alloc>, _Alloc >::type>
{
public:
typedef _Tp value_type;
typedef node<value_type, _Alloc> node_type;
typedef typename container_type_def<node_type, _Alloc>::type container_type;
typedef node<container_type> base_type;
graph() : base_type(container_type())
{
}
};
} // namespace TREE_NAMESPACE__
#endif /* TREE_HPP_ */