diff -r a42dacfd0e3e -r 58bc28afea63 src/work/marci/graph_wrapper.h
--- a/src/work/marci/graph_wrapper.h	Wed Apr 14 13:30:05 2004 +0000
+++ b/src/work/marci/graph_wrapper.h	Wed Apr 14 13:57:48 2004 +0000
@@ -462,19 +462,27 @@
       return i;
     }
 
-      
-    Node aNode(const OutEdgeIt& e) const { return Node(graph->aNode(e.e)); }
-    Node aNode(const InEdgeIt& e) const { return Node(graph->aNode(e.e)); }
-    Node bNode(const OutEdgeIt& e) const { return Node(graph->bNode(e.e)); }
-    Node bNode(const InEdgeIt& e) const { return Node(graph->bNode(e.e)); }
-    
 //     template<typename I> I& next(I &i) const { 
 //       graph->next(i); 
 // //      while (graph->valid(i) && !filter_map-get(i)) { graph->next(i); }
 //       while (graph->valid(i) && !(*edge_filter_map)[i]) { graph->next(i); }
 //       return i;
-//     }
-    
+//     } 
+
+    Node aNode(const OutEdgeIt& e) const { return Node(graph->aNode(e.e)); }
+    Node aNode(const InEdgeIt& e) const { return Node(graph->aNode(e.e)); }
+    Node bNode(const OutEdgeIt& e) const { return Node(graph->bNode(e.e)); }
+    Node bNode(const InEdgeIt& e) const { return Node(graph->bNode(e.e)); }
+
+    void hide(const Node& n) const { node_filter_map->set(n, false); }
+    void hide(const Edge& e) const { edge_filter_map->set(e, false); }
+
+    void unHide(const Node& n) const { node_filter_map->set(n, true); }
+    void unHide(const Edge& e) const { edge_filter_map->set(e, true); }
+
+    bool hidden(const Node& n) const { return (*node_filter_map)[n]; }
+    bool hidden(const Edge& e) const { return (*edge_filter_map)[e]; }
+
     template< typename It > It first() const { 
       It e; this->first(e); return e; }