# HG changeset patch
# User alpar
# Date 1100086920 0
# Node ID 785062a83f8ebd516e41232e8d531385744a4302
# Parent  6a6f3ac07b20e47c90d3d6c7d1b7f0e2e915b4f8
Changes in doc.

diff -r 6a6f3ac07b20 -r 785062a83f8e src/lemon/smart_graph.h
--- a/src/lemon/smart_graph.h	Tue Nov 09 17:48:52 2004 +0000
+++ b/src/lemon/smart_graph.h	Wed Nov 10 11:42:00 2004 +0000
@@ -232,20 +232,14 @@
 
   ///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.
   ///\sa concept::ExtendableGraph.
   ///
   ///\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
   class SmartGraph :public ClearableSmartGraphBase {
   public:
@@ -293,6 +287,7 @@
     ///\note After you rolled back to a state, you cannot roll "back" to
     ///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() 
     {
       SnapShot s;