1.1 --- a/doc/Doxyfile	Thu May 06 18:07:45 2004 +0000
     1.2 +++ b/doc/Doxyfile	Thu May 06 19:01:00 2004 +0000
     1.3 @@ -399,7 +399,6 @@
     1.4                           ../src/work/alpar/list_graph.h \
     1.5                           ../src/work/athos/minlengthpaths.h \
     1.6                           ../src/work/klao/path.h \
     1.7 -			 ../src/work/marci/graph_wrapper.h \
     1.8                           ../src/work/jacint/max_flow.h
     1.9  
    1.10  # If the value of the INPUT tag contains directories, you can use the 

     2.1 --- a/src/hugo/graph_wrapper.h	Thu May 06 18:07:45 2004 +0000
     2.2 +++ b/src/hugo/graph_wrapper.h	Thu May 06 19:01:00 2004 +0000
     2.3 @@ -436,26 +436,31 @@
     2.4      Node bNode(const InEdgeIt& e) const { 
     2.5        return Node(this->graph->bNode(e.e)); }
     2.6  
     2.7 -    ///\todo
     2.8 -    ///Some doki, please.
     2.9 +    /// This function hides \c n in the graph, i.e. the iteration 
    2.10 +    /// jumps over it. This is done by simply setting the value of \c n  
    2.11 +    /// to be false in the corresponding node-map.
    2.12      void hide(const Node& n) const { node_filter_map->set(n, false); }
    2.13 -    ///\todo
    2.14 -    ///Some doki, please.
    2.15 +
    2.16 +    /// This function hides \c e in the graph, i.e. the iteration 
    2.17 +    /// jumps over it. This is done by simply setting the value of \c e  
    2.18 +    /// to be false in the corresponding edge-map.
    2.19      void hide(const Edge& e) const { edge_filter_map->set(e, false); }
    2.20  
    2.21 -    ///\todo
    2.22 -    ///Some doki, please.
    2.23 -    void unHide(const Node& n) const { node_filter_map->set(n, true); }
    2.24 -    ///\todo
    2.25 -    ///Some doki, please.
    2.26 +    /// The value of \c n is set to be true in the node-map which stores 
    2.27 +    /// hide information. If \c n was hidden previuosly, then it is shown 
    2.28 +    /// again
    2.29 +     void unHide(const Node& n) const { node_filter_map->set(n, true); }
    2.30 +
    2.31 +    /// The value of \c e is set to be true in the edge-map which stores 
    2.32 +    /// hide information. If \c e was hidden previuosly, then it is shown 
    2.33 +    /// again
    2.34      void unHide(const Edge& e) const { edge_filter_map->set(e, true); }
    2.35  
    2.36 -    ///\todo
    2.37 -    ///Some doki, please.
    2.38 -    bool hidden(const Node& n) const { return (*node_filter_map)[n]; }
    2.39 -    ///\todo
    2.40 -    ///Some doki, please.
    2.41 -    bool hidden(const Edge& e) const { return (*edge_filter_map)[e]; }
    2.42 +    /// Returns true if \c n is hidden.
    2.43 +    bool hidden(const Node& n) const { return !(*node_filter_map)[n]; }
    2.44 +
    2.45 +    /// Returns true if \c n is hidden.
    2.46 +    bool hidden(const Edge& e) const { return !(*edge_filter_map)[e]; }
    2.47    };
    2.48  
    2.49    /// A wrapper for forgetting the orientation of a graph.