Changes in lemon/list_graph.h [835:c92296660262:833:e20173729589] in lemon

File:

• lemon/list_graph.h (modified) (8 diffs)

lemon/list_graph.h

@@ -325 +325 @@
   ///only in the concept class.
   ///
-  ///This class provides only linear time counting for nodes and arcs.
-  ///
   ///\sa concepts::Digraph
   ///\sa ListGraph
@@ -363 +361 @@
     ///\brief Erase a node from the digraph.
     ///
-    ///This function erases the given node along with its outgoing and
-    ///incoming arcs from the digraph.
-    ///
-    ///\note All iterators referencing the removed node or the connected
-    ///arcs are invalidated, of course.
+    ///This function erases the given node from the digraph.
     void erase(Node n) { Parent::erase(n); }
 
@@ -373 +367 @@
     ///
     ///This function erases the given arc from the digraph.
-    ///
-    ///\note All iterators referencing the removed arc are invalidated,
-    ///of course.
     void erase(Arc a) { Parent::erase(a); }
 
@@ -520 +511 @@
     ///This function erases all nodes and arcs from the digraph.
     ///
-    ///\note All iterators of the digraph are invalidated, of course.
     void clear() {
       Parent::clear();
@@ -1190 +1180 @@
   ///only in the concept class.
   ///
-  ///This class provides only linear time counting for nodes, edges and arcs.
-  ///
   ///\sa concepts::Graph
   ///\sa ListDigraph
@@ -1230 +1218 @@
     ///\brief Erase a node from the graph.
     ///
-    /// This function erases the given node along with its incident arcs
-    /// from the graph.
-    ///
-    /// \note All iterators referencing the removed node or the incident
-    /// edges are invalidated, of course.
+    /// This function erases the given node from the graph.
     void erase(Node n) { Parent::erase(n); }
 
@@ -1240 +1224 @@
     ///
     /// This function erases the given edge from the graph.
-    ///
-    /// \note All iterators referencing the removed edge are invalidated,
-    /// of course.
     void erase(Edge e) { Parent::erase(e); }
     /// Node validity check
@@ -1332 +1313 @@
     ///This function erases all nodes and arcs from the graph.
     ///
-    ///\note All iterators of the graph are invalidated, of course.
     void clear() {
       Parent::clear();