# HG changeset patch
# User marci
# Date 1082055660 0
# Node ID 5dc61ba307309a0b9b74d5c5319fea0d48704b38
# Parent  f5461f8bc59bbe42defafd2db346d3cf265d86fe
.

diff -r f5461f8bc59b -r 5dc61ba30730 src/work/marci/graph_concept.h
--- a/src/work/marci/graph_concept.h	Thu Apr 15 17:03:44 2004 +0000
+++ b/src/work/marci/graph_concept.h	Thu Apr 15 19:01:00 2004 +0000
@@ -3,15 +3,15 @@
 #define HUGO_GRAPH_H
 
 ///\file
-///\brief Declaration of GraphSkeleton.
+///\brief Declaration of GraphSkeleturo.
 
 #include <invalid.h>
 
 /// The namespace of HugoLib
 namespace hugo {
 
-  // @defgroup empty_graph The GraphSkeleton class
-  // @{
+  /// @defgroup empty_graph The GraphSkeleturo class
+  /// @{
 
   /// An empty graph class.
   
@@ -28,16 +28,16 @@
   /// feature, the documentation of a real graph imlementation
   /// 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.
 
@@ -87,7 +87,7 @@
       /// \sa Invalid for more details.
       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.
       NodeIt(const NodeIt &) {}
@@ -134,7 +134,7 @@
       /// node
       ///@param n the node
       ///@param G the graph
-      OutEdgeIt(const GraphSkeleton & G, Node n) {}
+      OutEdgeIt(const GraphSkeleturo & G, Node n) {}
     };
 
     /// This iterator goes trough the incoming edges of a node.
@@ -156,7 +156,7 @@
       InEdgeIt() {}
       /// Initialize the iterator to be invalid
       InEdgeIt(Invalid) {}
-      InEdgeIt(const GraphSkeleton &, Node) {}    
+      InEdgeIt(const GraphSkeleturo &, Node) {}    
     };
     //  class SymEdgeIt : public Edge {};
 
@@ -176,7 +176,7 @@
       EdgeIt() {}
       /// Initialize the iterator to be invalid
       EdgeIt(Invalid) {}
-      EdgeIt(const GraphSkeleton &) {}
+      EdgeIt(const GraphSkeleturo &) {}
     };
 
     /// First node of the graph.
@@ -268,7 +268,7 @@
     ///Read/write/reference map of the nodes to type \c T.
 
     ///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
     /// \todo We may need operator=
@@ -281,8 +281,8 @@
       typedef T ValueType;
       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) {}
 
@@ -309,7 +309,7 @@
     ///Read/write/reference map of the edges to type \c T.
     ///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
     /// \todo We may need operator=
@@ -319,8 +319,8 @@
       typedef T ValueType;
       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) {}
       T get(Edge i) const {return *(T*)0;}
@@ -341,7 +341,7 @@
   /// run properly, of course.
   ///
   /// \todo This blabla could be replaced by a sepatate description about
-  /// Skeletons.
+  /// Skeleturos.
   ///
   /// It can be used for checking the interface compatibility,
   /// or it can serve as a skeleton of a new graph structure.
@@ -350,7 +350,7 @@
   /// feature, the documentation of a real graph imlementation
   /// like @ref ListGraph or
   /// @ref SmartGraph will just refer to this structure.
-  class EraseableGraphSkeleton : public GraphSkeleton
+  class EraseableGraphSkeleturo : public GraphSkeleturo
   {
   public:
     /// Deletes a node.
@@ -359,15 +359,11 @@
     void erase(Edge e) {}
 
     /// 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 
   /// of its nodes.
   
@@ -377,7 +373,7 @@
   /// function. For wrappers or graphs which are given in an implicit way, 
   /// the implementation can be circumstantial, that is why this composes a 
   /// separate concept.
-  class NodeCountingGraphSkeleton 
+  class NodeCountingGraphSkeleturo 
   {
   public:
     /// Returns the number of nodes.
@@ -393,17 +389,20 @@
   /// function. For wrappers or graphs which are given in an implicit way, 
   /// the implementation can be circumstantial, that is why this composes a 
   /// separate concept.
-  class EdgeCountingGraphSkeleton 
+  class EdgeCountingGraphSkeleturo 
   {
   public:
     /// Returns the number of edges.
     int edgeNum() const { return 0;}
   };
+  
+  /// @}
 
 } //namespace hugo
 
 
-// class EmptyBipGraph : public Graph Skeleton
+
+// class EmptyBipGraph : public Graph Skeleturo
 // {
 //   class ANode {};
 //   class BNode {};