1.1 --- a/lemon/list_graph.h	Wed Jul 23 19:32:48 2008 +0200
     1.2 +++ b/lemon/list_graph.h	Mon Jul 28 09:29:30 2008 +0200
     1.3 @@ -363,6 +363,18 @@
     1.4        return Parent::addArc(s, t);
     1.5      }
     1.6  
     1.7 +    ///\brief Erase a node from the digraph.
     1.8 +    ///
     1.9 +    ///Erase a node from the digraph.
    1.10 +    ///
    1.11 +    void erase(const Node& n) { Parent::erase(n); }
    1.12 +
    1.13 +    ///\brief Erase an arc from the digraph.
    1.14 +    ///
    1.15 +    ///Erase an arc from the digraph.
    1.16 +    ///
    1.17 +    void erase(const Arc& a) { Parent::erase(a); }
    1.18 +
    1.19      /// Node validity check
    1.20  
    1.21      /// This function gives back true if the given node is valid,
    1.22 @@ -1207,6 +1219,18 @@
    1.23      Edge addEdge(const Node& s, const Node& t) {
    1.24        return Parent::addEdge(s, t);
    1.25      }
    1.26 +
    1.27 +    /// \brief Erase a node from the graph.
    1.28 +    ///
    1.29 +    /// Erase a node from the graph.
    1.30 +    ///
    1.31 +    void erase(const Node& n) { Parent::erase(n); }
    1.32 +
    1.33 +    /// \brief Erase an edge from the graph.
    1.34 +    ///
    1.35 +    /// Erase an edge from the graph.
    1.36 +    ///
    1.37 +    void erase(const Edge& e) { Parent::erase(e); }
    1.38      /// Node validity check
    1.39  
    1.40      /// This function gives back true if the given node is valid,