equal
deleted
inserted
replaced
360 template <typename _Graph> |
360 template <typename _Graph> |
361 struct Constraints { |
361 struct Constraints { |
362 |
362 |
363 void constraints() { |
363 void constraints() { |
364 checkConcept< BaseGraphComponent, _Graph >(); |
364 checkConcept< BaseGraphComponent, _Graph >(); |
365 typename _Graph::Node node; |
365 typename _Graph::Node node(INVALID); |
366 typename _Graph::Edge edge; |
366 typename _Graph::Edge edge(INVALID); |
367 { |
367 { |
368 graph.first(node); |
368 graph.first(node); |
369 graph.next(node); |
369 graph.next(node); |
370 } |
370 } |
371 { |
371 { |
440 struct Constraints { |
440 struct Constraints { |
441 |
441 |
442 void constraints() { |
442 void constraints() { |
443 checkConcept<Base, _Graph >(); |
443 checkConcept<Base, _Graph >(); |
444 checkConcept<BaseIterableGraphComponent<Base>, _Graph>(); |
444 checkConcept<BaseIterableGraphComponent<Base>, _Graph>(); |
445 typename _Graph::Node node; |
445 typename _Graph::Node node(INVALID); |
446 typename _Graph::UEdge uedge; |
446 typename _Graph::UEdge uedge(INVALID); |
447 bool dir; |
447 bool dir; |
448 { |
448 { |
449 graph.first(uedge); |
449 graph.first(uedge); |
450 graph.next(uedge); |
450 graph.next(uedge); |
451 } |
451 } |