1.1 --- a/src/work/marci/graph_wrapper.h	Wed Apr 14 13:30:05 2004 +0000
     1.2 +++ b/src/work/marci/graph_wrapper.h	Wed Apr 14 13:57:48 2004 +0000
     1.3 @@ -462,19 +462,27 @@
     1.4        return i;
     1.5      }
     1.6  
     1.7 -      
     1.8 -    Node aNode(const OutEdgeIt& e) const { return Node(graph->aNode(e.e)); }
     1.9 -    Node aNode(const InEdgeIt& e) const { return Node(graph->aNode(e.e)); }
    1.10 -    Node bNode(const OutEdgeIt& e) const { return Node(graph->bNode(e.e)); }
    1.11 -    Node bNode(const InEdgeIt& e) const { return Node(graph->bNode(e.e)); }
    1.12 -    
    1.13  //     template<typename I> I& next(I &i) const { 
    1.14  //       graph->next(i); 
    1.15  // //      while (graph->valid(i) && !filter_map-get(i)) { graph->next(i); }
    1.16  //       while (graph->valid(i) && !(*edge_filter_map)[i]) { graph->next(i); }
    1.17  //       return i;
    1.18 -//     }
    1.19 -    
    1.20 +//     } 
    1.21 +
    1.22 +    Node aNode(const OutEdgeIt& e) const { return Node(graph->aNode(e.e)); }
    1.23 +    Node aNode(const InEdgeIt& e) const { return Node(graph->aNode(e.e)); }
    1.24 +    Node bNode(const OutEdgeIt& e) const { return Node(graph->bNode(e.e)); }
    1.25 +    Node bNode(const InEdgeIt& e) const { return Node(graph->bNode(e.e)); }
    1.26 +
    1.27 +    void hide(const Node& n) const { node_filter_map->set(n, false); }
    1.28 +    void hide(const Edge& e) const { edge_filter_map->set(e, false); }
    1.29 +
    1.30 +    void unHide(const Node& n) const { node_filter_map->set(n, true); }
    1.31 +    void unHide(const Edge& e) const { edge_filter_map->set(e, true); }
    1.32 +
    1.33 +    bool hidden(const Node& n) const { return (*node_filter_map)[n]; }
    1.34 +    bool hidden(const Edge& e) const { return (*edge_filter_map)[e]; }
    1.35 +
    1.36      template< typename It > It first() const { 
    1.37        It e; this->first(e); return e; }
    1.38