Changeset 332:5dc61ba30730 in lemon-0.x for src

Timestamp:

04/15/04 21:01:00 (21 years ago)

Author:

marci

Branch:

default

Phase:

public

Convert:

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

Message:

.

File:

• src/work/marci/graph_concept.h (modified) (17 diffs)

src/work/marci/graph_concept.h

@@ -4 +4 @@
 
 ///\file
-///\brief Declaration of GraphSkeleton.
+///\brief Declaration of GraphSkeleturo.
 
 #include <invalid.h>
@@ -11 +11 @@
 namespace hugo {
 
-  // @defgroup empty_graph The GraphSkeleton class
-  // @{
+  /// @defgroup empty_graph The GraphSkeleturo class
+  /// @{
 
   /// An empty graph class.
@@ -29 +29 @@
   /// like @ref ListGraph or
   /// @ref SmartGraph will just refer to this structure.
-  class GraphSkeleton
+  class GraphSkeleturo
   {
   public:
     /// Defalult constructor.
-    GraphSkeleton() {}
+    GraphSkeleturo() {}
     ///Copy consructor.
 
     ///\todo It is not clear, what we expect from a copy constructor.
     ///E.g. How to assign the nodes/edges to each other? What about maps?
-    GraphSkeleton(const GraphSkeleton &G) {}
+    GraphSkeleturo(const GraphSkeleturo &G) {}
 
     /// The base type of the node iterators.
@@ -88 +88 @@
       NodeIt(Invalid) {}
       /// Sets the iterator to the first node of \c G.
-      NodeIt(const GraphSkeleton &G) {}
+      NodeIt(const GraphSkeleturo &G) {}
       /// @warning The default constructor sets the iterator
       /// to an undefined value.
@@ -135 +135 @@
       ///@param n the node
       ///@param G the graph
-      OutEdgeIt(const GraphSkeleton & G, Node n) {}
+      OutEdgeIt(const GraphSkeleturo & G, Node n) {}
     };
 
@@ -157 +157 @@
       /// Initialize the iterator to be invalid
       InEdgeIt(Invalid) {}
-      InEdgeIt(const GraphSkeleton &, Node) {}    
+      InEdgeIt(const GraphSkeleturo &, Node) {}    
     };
     //  class SymEdgeIt : public Edge {};
@@ -177 +177 @@
       /// Initialize the iterator to be invalid
       EdgeIt(Invalid) {}
-      EdgeIt(const GraphSkeleton &) {}
+      EdgeIt(const GraphSkeleturo &) {}
     };
 
@@ -269 +269 @@
 
     ///Read/write/reference map of the nodes to type \c T.
-    /// \sa MemoryMapSkeleton
+    /// \sa MemoryMapSkeleturo
     /// \todo We may need copy constructor
     /// \todo We may need conversion from other nodetype
@@ -282 +282 @@
       typedef Node KeyType;
 
-      NodeMap(const GraphSkeleton &G) {}
-      NodeMap(const GraphSkeleton &G, T t) {}
+      NodeMap(const GraphSkeleturo &G) {}
+      NodeMap(const GraphSkeleturo &G, T t) {}
 
       template<typename TT> NodeMap(const NodeMap<TT> &m) {}
@@ -310 +310 @@
     ///It behaves exactly in the same way as \ref NodeMap.
     /// \sa NodeMap
-    /// \sa MemoryMapSkeleton
+    /// \sa MemoryMapSkeleturo
     /// \todo We may need copy constructor
     /// \todo We may need conversion from other edgetype
@@ -320 +320 @@
       typedef Edge KeyType;
 
-      EdgeMap(const GraphSkeleton &G) {}
-      EdgeMap(const GraphSkeleton &G, T t) {}
+      EdgeMap(const GraphSkeleturo &G) {}
+      EdgeMap(const GraphSkeleturo &G, T t) {}
     
       void set(Edge i, T t) {}
@@ -342 +342 @@
   ///
   /// \todo This blabla could be replaced by a sepatate description about
-  /// Skeletons.
+  /// Skeleturos.
   ///
   /// It can be used for checking the interface compatibility,
@@ -351 +351 @@
   /// like @ref ListGraph or
   /// @ref SmartGraph will just refer to this structure.
-  class EraseableGraphSkeleton : public GraphSkeleton
+  class EraseableGraphSkeleturo : public GraphSkeleturo
   {
   public:
@@ -360 +360 @@
 
     /// Defalult constructor.
-    GraphSkeleton() {}
+    GraphSkeleturo() {}
     ///Copy consructor.
-    GraphSkeleton(const GraphSkeleton &G) {}
+    GraphSkeleturo(const GraphSkeleturo &G) {}
   };
-
-  
-  // @}
-
 
   /// An empty graph class which provides a function to get the number 
@@ -378 +374 @@
   /// the implementation can be circumstantial, that is why this composes a 
   /// separate concept.
-  class NodeCountingGraphSkeleton 
+  class NodeCountingGraphSkeleturo 
   {
   public:
@@ -394 +390 @@
   /// the implementation can be circumstantial, that is why this composes a 
   /// separate concept.
-  class EdgeCountingGraphSkeleton 
+  class EdgeCountingGraphSkeleturo 
   {
   public:
@@ -400 +396 @@
     int edgeNum() const { return 0;}
   };
+  
+  /// @}
 
 } //namespace hugo
 
 
-// class EmptyBipGraph : public Graph Skeleton
+
+// class EmptyBipGraph : public Graph Skeleturo
 // {
 //   class ANode {};