1.1 --- a/src/hugo/graph_wrapper.h	Thu May 06 18:07:45 2004 +0000
     1.2 +++ b/src/hugo/graph_wrapper.h	Thu May 06 19:01:00 2004 +0000
     1.3 @@ -436,26 +436,31 @@
     1.4      Node bNode(const InEdgeIt& e) const { 
     1.5        return Node(this->graph->bNode(e.e)); }
     1.6  
     1.7 -    ///\todo
     1.8 -    ///Some doki, please.
     1.9 +    /// This function hides \c n in the graph, i.e. the iteration 
    1.10 +    /// jumps over it. This is done by simply setting the value of \c n  
    1.11 +    /// to be false in the corresponding node-map.
    1.12      void hide(const Node& n) const { node_filter_map->set(n, false); }
    1.13 -    ///\todo
    1.14 -    ///Some doki, please.
    1.15 +
    1.16 +    /// This function hides \c e in the graph, i.e. the iteration 
    1.17 +    /// jumps over it. This is done by simply setting the value of \c e  
    1.18 +    /// to be false in the corresponding edge-map.
    1.19      void hide(const Edge& e) const { edge_filter_map->set(e, false); }
    1.20  
    1.21 -    ///\todo
    1.22 -    ///Some doki, please.
    1.23 -    void unHide(const Node& n) const { node_filter_map->set(n, true); }
    1.24 -    ///\todo
    1.25 -    ///Some doki, please.
    1.26 +    /// The value of \c n is set to be true in the node-map which stores 
    1.27 +    /// hide information. If \c n was hidden previuosly, then it is shown 
    1.28 +    /// again
    1.29 +     void unHide(const Node& n) const { node_filter_map->set(n, true); }
    1.30 +
    1.31 +    /// The value of \c e is set to be true in the edge-map which stores 
    1.32 +    /// hide information. If \c e was hidden previuosly, then it is shown 
    1.33 +    /// again
    1.34      void unHide(const Edge& e) const { edge_filter_map->set(e, true); }
    1.35  
    1.36 -    ///\todo
    1.37 -    ///Some doki, please.
    1.38 -    bool hidden(const Node& n) const { return (*node_filter_map)[n]; }
    1.39 -    ///\todo
    1.40 -    ///Some doki, please.
    1.41 -    bool hidden(const Edge& e) const { return (*edge_filter_map)[e]; }
    1.42 +    /// Returns true if \c n is hidden.
    1.43 +    bool hidden(const Node& n) const { return !(*node_filter_map)[n]; }
    1.44 +
    1.45 +    /// Returns true if \c n is hidden.
    1.46 +    bool hidden(const Edge& e) const { return !(*edge_filter_map)[e]; }
    1.47    };
    1.48  
    1.49    /// A wrapper for forgetting the orientation of a graph.