0
3
0
... | ... |
@@ -1303,25 +1303,25 @@ |
1303 | 1303 |
/// does not observe the BFS events. If you want to observe the BFS |
1304 | 1304 |
/// events, you should implement your own visitor class. |
1305 | 1305 |
/// \tparam _Traits Traits class to set various data types used by the |
1306 | 1306 |
/// algorithm. The default traits class is |
1307 | 1307 |
/// \ref BfsVisitDefaultTraits "BfsVisitDefaultTraits<_Digraph>". |
1308 | 1308 |
/// See \ref BfsVisitDefaultTraits for the documentation of |
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; |
1322 | 1322 |
|
1323 | 1323 |
///The type of the digraph the algorithm runs on. |
1324 | 1324 |
typedef typename Traits::Digraph Digraph; |
1325 | 1325 |
|
1326 | 1326 |
///The visitor type used by the algorithm. |
1327 | 1327 |
typedef _Visitor Visitor; |
... | ... |
@@ -289,29 +289,29 @@ |
289 | 289 |
|
290 | 290 |
|
291 | 291 |
using Parent::first; |
292 | 292 |
using Parent::next; |
293 | 293 |
|
294 | 294 |
using Parent::id; |
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 |
|
|
301 |
LEMON_DEBUG(Parent::red(node) || node == INVALID, |
|
302 | 302 |
typename Parent::NodeSetError()); |
303 | 303 |
} |
304 | 304 |
Red& operator=(const Node& node) { |
305 |
|
|
305 |
LEMON_DEBUG(Parent::red(node) || node == INVALID, |
|
306 | 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); |
313 | 313 |
return *this; |
314 | 314 |
} |
315 | 315 |
}; |
316 | 316 |
|
317 | 317 |
void first(Red& node) const { |
... | ... |
@@ -321,29 +321,29 @@ |
321 | 321 |
Parent::nextRed(static_cast<Node&>(node)); |
322 | 322 |
} |
323 | 323 |
|
324 | 324 |
int id(const Red& node) const { |
325 | 325 |
return Parent::redId(node); |
326 | 326 |
} |
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 |
|
|
333 |
LEMON_DEBUG(Parent::blue(node) || node == INVALID, |
|
334 | 334 |
typename Parent::NodeSetError()); |
335 | 335 |
} |
336 | 336 |
Blue& operator=(const Node& node) { |
337 |
|
|
337 |
LEMON_DEBUG(Parent::blue(node) || node == INVALID, |
|
338 | 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); |
345 | 345 |
return *this; |
346 | 346 |
} |
347 | 347 |
}; |
348 | 348 |
|
349 | 349 |
void first(Blue& node) const { |
... | ... |
@@ -1249,25 +1249,25 @@ |
1249 | 1249 |
/// does not observe the DFS events. If you want to observe the DFS |
1250 | 1250 |
/// events, you should implement your own visitor class. |
1251 | 1251 |
/// \tparam _Traits Traits class to set various data types used by the |
1252 | 1252 |
/// algorithm. The default traits class is |
1253 | 1253 |
/// \ref DfsVisitDefaultTraits "DfsVisitDefaultTraits<_Digraph>". |
1254 | 1254 |
/// See \ref DfsVisitDefaultTraits for the documentation of |
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; |
1268 | 1268 |
|
1269 | 1269 |
///The type of the digraph the algorithm runs on. |
1270 | 1270 |
typedef typename Traits::Digraph Digraph; |
1271 | 1271 |
|
1272 | 1272 |
///The visitor type used by the algorithm. |
1273 | 1273 |
typedef _Visitor Visitor; |
0 comments (0 inline)