Changeset 323:58bc28afea63 in lemon-0.x for src/work/marci/graph_wrapper.h
- Timestamp:
- 04/14/04 15:57:48 (21 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@441
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
src/work/marci/graph_wrapper.h
r318 r323 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 472 Node aNode(const OutEdgeIt& e) const { return Node(graph->aNode(e.e)); } 467 473 Node aNode(const InEdgeIt& e) const { return Node(graph->aNode(e.e)); } 468 474 Node bNode(const OutEdgeIt& e) const { return Node(graph->bNode(e.e)); } 469 475 Node bNode(const InEdgeIt& e) const { return Node(graph->bNode(e.e)); } 470 471 // template<typename I> I& next(I &i) const { 472 // graph->next(i); 473 // // while (graph->valid(i) && !filter_map-get(i)) { graph->next(i); } 474 // while (graph->valid(i) && !(*edge_filter_map)[i]) { graph->next(i); } 475 // return i; 476 // } 477 476 477 void hide(const Node& n) const { node_filter_map->set(n, false); } 478 void hide(const Edge& e) const { edge_filter_map->set(e, false); } 479 480 void unHide(const Node& n) const { node_filter_map->set(n, true); } 481 void unHide(const Edge& e) const { edge_filter_map->set(e, true); } 482 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 486 template< typename It > It first() const { 479 487 It e; this->first(e); return e; }
Note: See TracChangeset
for help on using the changeset viewer.