1.1 --- a/src/lemon/smart_graph.h	Sat Oct 30 18:30:29 2004 +0000
     1.2 +++ b/src/lemon/smart_graph.h	Sat Oct 30 18:33:14 2004 +0000
     1.3 @@ -45,23 +45,6 @@
     1.4    /// \addtogroup graphs
     1.5    /// @{
     1.6  
     1.7 -  ///A smart graph class.
     1.8 -
     1.9 -  ///This is a simple and fast graph implementation.
    1.10 -  ///It is also quite memory efficient, but at the price
    1.11 -  ///that <b> it does not support node and edge deletion</b>.
    1.12 -  ///It conforms to 
    1.13 -  ///the \ref skeleton::ExtendableGraph "ExtendableGraph" concept.
    1.14 -  ///\sa skeleton::ExtendableGraph.
    1.15 -  ///
    1.16 -  ///\todo Some member functions could be \c static.
    1.17 -  ///
    1.18 -  ///\todo A possibly useful functionality: a function saveState() would
    1.19 -  ///give back a data sturcture X and then the function restoreState(X)
    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 SmartGraphBase {
    1.25  
    1.26      struct NodeT 
    1.27 @@ -240,9 +223,27 @@
    1.28    typedef ExtendableGraphExtender<MappableSmartGraphBase> ExtendableSmartGraphBase;
    1.29    typedef ClearableGraphExtender<ExtendableSmartGraphBase> ClearableSmartGraphBase;
    1.30  
    1.31 -  typedef ClearableSmartGraphBase SmartGraph;
    1.32 +  ///A smart graph class.
    1.33  
    1.34 -
    1.35 +  ///This is a simple and fast graph implementation.
    1.36 +  ///It is also quite memory efficient, but at the price
    1.37 +  ///that <b> it does not support node and edge deletion</b>.
    1.38 +  ///It conforms to 
    1.39 +  ///the \ref skeleton::ExtendableGraph "ExtendableGraph" concept.
    1.40 +  ///\sa skeleton::ExtendableGraph.
    1.41 +  ///
    1.42 +  ///\todo Some member functions could be \c static.
    1.43 +  ///
    1.44 +  ///\todo A possibly useful functionality: a function saveState()
    1.45 +  ///(or snapshot() ) would
    1.46 +  ///give back a data sturcture X and then the function restoreState(X)
    1.47 +  ///(or rollBack() )
    1.48 +  ///would remove the nodes and edges added after the call of saveState().
    1.49 +  ///Of course it should be used as a stack. (Maybe X is not necessary.)
    1.50 +  ///
    1.51 +  ///\author Alpar Juttner
    1.52 +  class SmartGraph :public ClearableSmartGraphBase { };
    1.53 +  
    1.54    template <>
    1.55    int countNodes<SmartGraph>(const SmartGraph& graph) {
    1.56      return graph.nodeNum();