0
3
0
... | ... |
@@ -1309,13 +1309,13 @@ |
1309 | 1309 |
/// a BFS visit traits class. |
1310 | 1310 |
#ifdef DOXYGEN |
1311 | 1311 |
template <typename _Digraph, typename _Visitor, typename _Traits> |
1312 | 1312 |
#else |
1313 | 1313 |
template <typename _Digraph = ListDigraph, |
1314 | 1314 |
typename _Visitor = BfsVisitor<_Digraph>, |
1315 |
typename _Traits = |
|
1315 |
typename _Traits = BfsVisitDefaultTraits<_Digraph> > |
|
1316 | 1316 |
#endif |
1317 | 1317 |
class BfsVisit { |
1318 | 1318 |
public: |
1319 | 1319 |
|
1320 | 1320 |
///The traits class. |
1321 | 1321 |
typedef _Traits Traits; |
... | ... |
@@ -295,18 +295,18 @@ |
295 | 295 |
|
296 | 296 |
class Red : public Node { |
297 | 297 |
friend class BidirBpGraphExtender; |
298 | 298 |
public: |
299 | 299 |
Red() {} |
300 | 300 |
Red(const Node& node) : Node(node) { |
301 |
LEMON_ASSERT(Parent::red(node) || node == INVALID, |
|
302 |
typename Parent::NodeSetError()); |
|
301 |
LEMON_DEBUG(Parent::red(node) || node == INVALID, |
|
302 |
typename Parent::NodeSetError()); |
|
303 | 303 |
} |
304 | 304 |
Red& operator=(const Node& node) { |
305 |
LEMON_ASSERT(Parent::red(node) || node == INVALID, |
|
306 |
typename Parent::NodeSetError()); |
|
305 |
LEMON_DEBUG(Parent::red(node) || node == INVALID, |
|
306 |
typename Parent::NodeSetError()); |
|
307 | 307 |
Node::operator=(node); |
308 | 308 |
return *this; |
309 | 309 |
} |
310 | 310 |
Red(Invalid) : Node(INVALID) {} |
311 | 311 |
Red& operator=(Invalid) { |
312 | 312 |
Node::operator=(INVALID); |
... | ... |
@@ -327,18 +327,18 @@ |
327 | 327 |
|
328 | 328 |
class Blue : public Node { |
329 | 329 |
friend class BidirBpGraphExtender; |
330 | 330 |
public: |
331 | 331 |
Blue() {} |
332 | 332 |
Blue(const Node& node) : Node(node) { |
333 |
LEMON_ASSERT(Parent::blue(node) || node == INVALID, |
|
334 |
typename Parent::NodeSetError()); |
|
333 |
LEMON_DEBUG(Parent::blue(node) || node == INVALID, |
|
334 |
typename Parent::NodeSetError()); |
|
335 | 335 |
} |
336 | 336 |
Blue& operator=(const Node& node) { |
337 |
LEMON_ASSERT(Parent::blue(node) || node == INVALID, |
|
338 |
typename Parent::NodeSetError()); |
|
337 |
LEMON_DEBUG(Parent::blue(node) || node == INVALID, |
|
338 |
typename Parent::NodeSetError()); |
|
339 | 339 |
Node::operator=(node); |
340 | 340 |
return *this; |
341 | 341 |
} |
342 | 342 |
Blue(Invalid) : Node(INVALID) {} |
343 | 343 |
Blue& operator=(Invalid) { |
344 | 344 |
Node::operator=(INVALID); |
... | ... |
@@ -1255,13 +1255,13 @@ |
1255 | 1255 |
/// a DFS visit traits class. |
1256 | 1256 |
#ifdef DOXYGEN |
1257 | 1257 |
template <typename _Digraph, typename _Visitor, typename _Traits> |
1258 | 1258 |
#else |
1259 | 1259 |
template <typename _Digraph = ListDigraph, |
1260 | 1260 |
typename _Visitor = DfsVisitor<_Digraph>, |
1261 |
typename _Traits = |
|
1261 |
typename _Traits = DfsVisitDefaultTraits<_Digraph> > |
|
1262 | 1262 |
#endif |
1263 | 1263 |
class DfsVisit { |
1264 | 1264 |
public: |
1265 | 1265 |
|
1266 | 1266 |
///The traits class. |
1267 | 1267 |
typedef _Traits Traits; |
0 comments (0 inline)