460 graph->next(i.e); |
460 graph->next(i.e); |
461 while (graph->valid(i) && !(*edge_filter_map)[i.e]) { graph->next(i.e); } |
461 while (graph->valid(i) && !(*edge_filter_map)[i.e]) { graph->next(i.e); } |
462 return i; |
462 return i; |
463 } |
463 } |
464 |
464 |
465 |
465 // template<typename I> I& next(I &i) const { |
|
466 // graph->next(i); |
|
467 // // while (graph->valid(i) && !filter_map-get(i)) { graph->next(i); } |
|
468 // while (graph->valid(i) && !(*edge_filter_map)[i]) { graph->next(i); } |
|
469 // return i; |
|
470 // } |
|
471 |
466 Node aNode(const OutEdgeIt& e) const { return Node(graph->aNode(e.e)); } |
472 Node aNode(const OutEdgeIt& e) const { return Node(graph->aNode(e.e)); } |
467 Node aNode(const InEdgeIt& e) const { return Node(graph->aNode(e.e)); } |
473 Node aNode(const InEdgeIt& e) const { return Node(graph->aNode(e.e)); } |
468 Node bNode(const OutEdgeIt& e) const { return Node(graph->bNode(e.e)); } |
474 Node bNode(const OutEdgeIt& e) const { return Node(graph->bNode(e.e)); } |
469 Node bNode(const InEdgeIt& e) const { return Node(graph->bNode(e.e)); } |
475 Node bNode(const InEdgeIt& e) const { return Node(graph->bNode(e.e)); } |
470 |
476 |
471 // template<typename I> I& next(I &i) const { |
477 void hide(const Node& n) const { node_filter_map->set(n, false); } |
472 // graph->next(i); |
478 void hide(const Edge& e) const { edge_filter_map->set(e, false); } |
473 // // while (graph->valid(i) && !filter_map-get(i)) { graph->next(i); } |
479 |
474 // while (graph->valid(i) && !(*edge_filter_map)[i]) { graph->next(i); } |
480 void unHide(const Node& n) const { node_filter_map->set(n, true); } |
475 // return i; |
481 void unHide(const Edge& e) const { edge_filter_map->set(e, true); } |
476 // } |
482 |
477 |
483 bool hidden(const Node& n) const { return (*node_filter_map)[n]; } |
|
484 bool hidden(const Edge& e) const { return (*edge_filter_map)[e]; } |
|
485 |
478 template< typename It > It first() const { |
486 template< typename It > It first() const { |
479 It e; this->first(e); return e; } |
487 It e; this->first(e); return e; } |
480 |
488 |
481 template< typename It > It first(const Node& v) const { |
489 template< typename It > It first(const Node& v) const { |
482 It e; this->first(e, v); return e; } |
490 It e; this->first(e, v); return e; } |