[Lemon-commits] [lemon_svn] alpar: r1330 - in hugo/trunk/src/lemon: . skeletons

[Lemon SVN]

Author: alpar
Date: Sat Oct 30 20:33:14 2004
New Revision: 1330

Modified:
   hugo/trunk/src/lemon/skeletons/graph_component.h
   hugo/trunk/src/lemon/smart_graph.h

Log:
- Changes in doc (spell check).
- SmallGraph is a class instead of being a typedef. (For the sake of doxygen.)

Modified: hugo/trunk/src/lemon/skeletons/graph_component.h
==============================================================================
--- hugo/trunk/src/lemon/skeletons/graph_component.h	(original)
+++ hugo/trunk/src/lemon/skeletons/graph_component.h	Sat Oct 30 20:33:14 2004
@@ -196,7 +196,7 @@
   
     /// This class provides beside the core graph features
     /// core iterable interface for the graph structure.
-    /// The most of the base graphs should be conform to this concept.
+    /// Most of the base graphs should be conform to this concept.
 
     class BaseIterableGraphComponent : virtual public BaseGraphComponent {
     public:

Modified: hugo/trunk/src/lemon/smart_graph.h
==============================================================================
--- hugo/trunk/src/lemon/smart_graph.h	(original)
+++ hugo/trunk/src/lemon/smart_graph.h	Sat Oct 30 20:33:14 2004
@@ -45,23 +45,6 @@
   /// \addtogroup graphs
   /// @{
 
-  ///A smart graph class.
-
-  ///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>.
-  ///It conforms to 
-  ///the \ref skeleton::ExtendableGraph "ExtendableGraph" concept.
-  ///\sa skeleton::ExtendableGraph.
-  ///
-  ///\todo Some member functions could be \c static.
-  ///
-  ///\todo A possibly useful functionality: a function saveState() would
-  ///give back a data sturcture X and then the function restoreState(X)
-  ///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 SmartGraphBase {
 
     struct NodeT 
@@ -240,9 +223,27 @@
   typedef ExtendableGraphExtender<MappableSmartGraphBase> ExtendableSmartGraphBase;
   typedef ClearableGraphExtender<ExtendableSmartGraphBase> ClearableSmartGraphBase;
 
-  typedef ClearableSmartGraphBase SmartGraph;
-
+  ///A smart graph class.
 
+  ///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>.
+  ///It conforms to 
+  ///the \ref skeleton::ExtendableGraph "ExtendableGraph" concept.
+  ///\sa skeleton::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 { };
+  
   template <>
   int countNodes<SmartGraph>(const SmartGraph& graph) {
     return graph.nodeNum();