# HG changeset patch
# User marci
# Date 1083870060 0
# Node ID a10e6f1769e2d24289e45a00948084bace5323e6
# Parent  5adcef1d7bcc067dd4b3b8d0a444654791307508


diff -r 5adcef1d7bcc -r a10e6f1769e2 doc/Doxyfile
--- a/doc/Doxyfile	Thu May 06 18:07:45 2004 +0000
+++ b/doc/Doxyfile	Thu May 06 19:01:00 2004 +0000
@@ -399,7 +399,6 @@
                          ../src/work/alpar/list_graph.h \
                          ../src/work/athos/minlengthpaths.h \
                          ../src/work/klao/path.h \
-			 ../src/work/marci/graph_wrapper.h \
                          ../src/work/jacint/max_flow.h
 
 # If the value of the INPUT tag contains directories, you can use the 
diff -r 5adcef1d7bcc -r a10e6f1769e2 src/hugo/graph_wrapper.h
--- a/src/hugo/graph_wrapper.h	Thu May 06 18:07:45 2004 +0000
+++ b/src/hugo/graph_wrapper.h	Thu May 06 19:01:00 2004 +0000
@@ -436,26 +436,31 @@
     Node bNode(const InEdgeIt& e) const { 
       return Node(this->graph->bNode(e.e)); }
 
-    ///\todo
-    ///Some doki, please.
+    /// This function hides \c n in the graph, i.e. the iteration 
+    /// jumps over it. This is done by simply setting the value of \c n  
+    /// to be false in the corresponding node-map.
     void hide(const Node& n) const { node_filter_map->set(n, false); }
-    ///\todo
-    ///Some doki, please.
+
+    /// This function hides \c e in the graph, i.e. the iteration 
+    /// jumps over it. This is done by simply setting the value of \c e  
+    /// to be false in the corresponding edge-map.
     void hide(const Edge& e) const { edge_filter_map->set(e, false); }
 
-    ///\todo
-    ///Some doki, please.
-    void unHide(const Node& n) const { node_filter_map->set(n, true); }
-    ///\todo
-    ///Some doki, please.
+    /// The value of \c n is set to be true in the node-map which stores 
+    /// hide information. If \c n was hidden previuosly, then it is shown 
+    /// again
+     void unHide(const Node& n) const { node_filter_map->set(n, true); }
+
+    /// The value of \c e is set to be true in the edge-map which stores 
+    /// hide information. If \c e was hidden previuosly, then it is shown 
+    /// again
     void unHide(const Edge& e) const { edge_filter_map->set(e, true); }
 
-    ///\todo
-    ///Some doki, please.
-    bool hidden(const Node& n) const { return (*node_filter_map)[n]; }
-    ///\todo
-    ///Some doki, please.
-    bool hidden(const Edge& e) const { return (*edge_filter_map)[e]; }
+    /// Returns true if \c n is hidden.
+    bool hidden(const Node& n) const { return !(*node_filter_map)[n]; }
+
+    /// Returns true if \c n is hidden.
+    bool hidden(const Edge& e) const { return !(*edge_filter_map)[e]; }
   };
 
   /// A wrapper for forgetting the orientation of a graph.