1.1 --- a/src/lemon/skeletons/graph_component.h	Sat Oct 30 18:30:29 2004 +0000
     1.2 +++ b/src/lemon/skeletons/graph_component.h	Sat Oct 30 18:33:14 2004 +0000
     1.3 @@ -196,7 +196,7 @@
     1.4    
     1.5      /// This class provides beside the core graph features
     1.6      /// core iterable interface for the graph structure.
     1.7 -    /// The most of the base graphs should be conform to this concept.
     1.8 +    /// Most of the base graphs should be conform to this concept.
     1.9  
    1.10      class BaseIterableGraphComponent : virtual public BaseGraphComponent {
    1.11      public:

     2.1 --- a/src/lemon/smart_graph.h	Sat Oct 30 18:30:29 2004 +0000
     2.2 +++ b/src/lemon/smart_graph.h	Sat Oct 30 18:33:14 2004 +0000
     2.3 @@ -45,23 +45,6 @@
     2.4    /// \addtogroup graphs
     2.5    /// @{
     2.6  
     2.7 -  ///A smart graph class.
     2.8 -
     2.9 -  ///This is a simple and fast graph implementation.
    2.10 -  ///It is also quite memory efficient, but at the price
    2.11 -  ///that <b> it does not support node and edge deletion</b>.
    2.12 -  ///It conforms to 
    2.13 -  ///the \ref skeleton::ExtendableGraph "ExtendableGraph" concept.
    2.14 -  ///\sa skeleton::ExtendableGraph.
    2.15 -  ///
    2.16 -  ///\todo Some member functions could be \c static.
    2.17 -  ///
    2.18 -  ///\todo A possibly useful functionality: a function saveState() would
    2.19 -  ///give back a data sturcture X and then the function restoreState(X)
    2.20 -  ///would remove the nodes and edges added after the call of saveState().
    2.21 -  ///Of course it should be used as a stack. (Maybe X is not necessary.)
    2.22 -  ///
    2.23 -  ///\author Alpar Juttner
    2.24    class SmartGraphBase {
    2.25  
    2.26      struct NodeT 
    2.27 @@ -240,9 +223,27 @@
    2.28    typedef ExtendableGraphExtender<MappableSmartGraphBase> ExtendableSmartGraphBase;
    2.29    typedef ClearableGraphExtender<ExtendableSmartGraphBase> ClearableSmartGraphBase;
    2.30  
    2.31 -  typedef ClearableSmartGraphBase SmartGraph;
    2.32 +  ///A smart graph class.
    2.33  
    2.34 -
    2.35 +  ///This is a simple and fast graph implementation.
    2.36 +  ///It is also quite memory efficient, but at the price
    2.37 +  ///that <b> it does not support node and edge deletion</b>.
    2.38 +  ///It conforms to 
    2.39 +  ///the \ref skeleton::ExtendableGraph "ExtendableGraph" concept.
    2.40 +  ///\sa skeleton::ExtendableGraph.
    2.41 +  ///
    2.42 +  ///\todo Some member functions could be \c static.
    2.43 +  ///
    2.44 +  ///\todo A possibly useful functionality: a function saveState()
    2.45 +  ///(or snapshot() ) would
    2.46 +  ///give back a data sturcture X and then the function restoreState(X)
    2.47 +  ///(or rollBack() )
    2.48 +  ///would remove the nodes and edges added after the call of saveState().
    2.49 +  ///Of course it should be used as a stack. (Maybe X is not necessary.)
    2.50 +  ///
    2.51 +  ///\author Alpar Juttner
    2.52 +  class SmartGraph :public ClearableSmartGraphBase { };
    2.53 +  
    2.54    template <>
    2.55    int countNodes<SmartGraph>(const SmartGraph& graph) {
    2.56      return graph.nodeNum();