Changeset 950:d74557d1f100 in lemon-0.x for src/lemon

Timestamp:

10/30/04 20:33:14 (19 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1330

Message:

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

Location:

src/lemon

Files:

• skeletons/graph_component.h (modified) (1 diff)
• smart_graph.h (modified) (2 diffs)

src/lemon/skeletons/graph_component.h

@@ -197 +197 @@
     /// 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 {

src/lemon/smart_graph.h

@@ -46 +46 @@
   /// @{
 
-  ///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 {
 
@@ -241 +224 @@
   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) {