# HG changeset patch
# User Balazs Dezso <deba@inf.elte.hu>
# Date 1217230170 -7200
# Node ID ad6b8c47bd56c03d587feab33d875a72b2adfd6f
# Parent  28239207a8a3ab9d5d248f1b36acc18e6779c502
Erase in the documentation of list graphs

diff -r 28239207a8a3 -r ad6b8c47bd56 lemon/list_graph.h
--- a/lemon/list_graph.h	Wed Jul 23 19:32:48 2008 +0200
+++ b/lemon/list_graph.h	Mon Jul 28 09:29:30 2008 +0200
@@ -363,6 +363,18 @@
       return Parent::addArc(s, t);
     }
 
+    ///\brief Erase a node from the digraph.
+    ///
+    ///Erase a node from the digraph.
+    ///
+    void erase(const Node& n) { Parent::erase(n); }
+
+    ///\brief Erase an arc from the digraph.
+    ///
+    ///Erase an arc from the digraph.
+    ///
+    void erase(const Arc& a) { Parent::erase(a); }
+
     /// Node validity check
 
     /// This function gives back true if the given node is valid,
@@ -1207,6 +1219,18 @@
     Edge addEdge(const Node& s, const Node& t) {
       return Parent::addEdge(s, t);
     }
+
+    /// \brief Erase a node from the graph.
+    ///
+    /// Erase a node from the graph.
+    ///
+    void erase(const Node& n) { Parent::erase(n); }
+
+    /// \brief Erase an edge from the graph.
+    ///
+    /// Erase an edge from the graph.
+    ///
+    void erase(const Edge& e) { Parent::erase(e); }
     /// Node validity check
 
     /// This function gives back true if the given node is valid,