1.1 --- a/src/lemon/smart_graph.h	Tue Nov 09 17:48:52 2004 +0000
     1.2 +++ b/src/lemon/smart_graph.h	Wed Nov 10 11:42:00 2004 +0000
     1.3 @@ -232,20 +232,14 @@
     1.4  
     1.5    ///This is a simple and fast graph implementation.
     1.6    ///It is also quite memory efficient, but at the price
     1.7 -  ///that <b> it does not support node and edge deletion</b>.
     1.8 +  ///that <b> it does support only limited (only stack-like)
     1.9 +  ///node and edge deletions</b>.
    1.10    ///It conforms to 
    1.11    ///the \ref concept::ExtendableGraph "ExtendableGraph" concept.
    1.12    ///\sa concept::ExtendableGraph.
    1.13    ///
    1.14    ///\todo Some member functions could be \c static.
    1.15    ///
    1.16 -  ///\todo A possibly useful functionality: a function saveState()
    1.17 -  ///(or snapshot() ) would
    1.18 -  ///give back a data sturcture X and then the function restoreState(X)
    1.19 -  ///(or rollBack() )
    1.20 -  ///would remove the nodes and edges added after the call of saveState().
    1.21 -  ///Of course it should be used as a stack. (Maybe X is not necessary.)
    1.22 -  ///
    1.23    ///\author Alpar Juttner
    1.24    class SmartGraph :public ClearableSmartGraphBase {
    1.25    public:
    1.26 @@ -293,6 +287,7 @@
    1.27      ///\note After you rolled back to a state, you cannot roll "back" to
    1.28      ///a later state, in other word you cannot add again the edges deleted
    1.29      ///by rollBack().
    1.30 +    ///\todo This function might be called saveState() or getState().
    1.31      SnapShot makeSnapShot() 
    1.32      {
    1.33        SnapShot s;