Index: src/lemon/smart_graph.h
===================================================================
--- src/lemon/smart_graph.h	(revision 973)
+++ src/lemon/smart_graph.h	(revision 974)
@@ -233,5 +233,6 @@
   ///This is a simple and fast graph implementation.
   ///It is also quite memory efficient, but at the price
-  ///that <b> it does not support node and edge deletion</b>.
+  ///that <b> it does support only limited (only stack-like)
+  ///node and edge deletions</b>.
   ///It conforms to 
   ///the \ref concept::ExtendableGraph "ExtendableGraph" concept.
@@ -239,11 +240,4 @@
   ///
   ///\todo Some member functions could be \c static.
-  ///
-  ///\todo A possibly useful functionality: a function saveState()
-  ///(or snapshot() ) would
-  ///give back a data sturcture X and then the function restoreState(X)
-  ///(or rollBack() )
-  ///would remove the nodes and edges added after the call of saveState().
-  ///Of course it should be used as a stack. (Maybe X is not necessary.)
   ///
   ///\author Alpar Juttner
@@ -294,4 +288,5 @@
     ///a later state, in other word you cannot add again the edges deleted
     ///by rollBack().
+    ///\todo This function might be called saveState() or getState().
     SnapShot makeSnapShot() 
     {