1.1 --- a/src/hugo/skeletons/graph.h	Thu Sep 09 07:09:41 2004 +0000
     1.2 +++ b/src/hugo/skeletons/graph.h	Thu Sep 09 09:18:41 2004 +0000
     1.3 @@ -456,22 +456,22 @@
     1.4  
     1.5        /// This function deletes all edges and nodes of the graph.
     1.6        /// It also frees the memory allocated to store them.
     1.7 -      /// \todo It might belong to \c EraseableGraphSkeleton.
     1.8 +      /// \todo It might belong to \c ErasableGraphSkeleton.
     1.9        void clear() { }
    1.10      };
    1.11  
    1.12 -    /// An empty eraseable graph class.
    1.13 +    /// An empty erasable graph class.
    1.14    
    1.15      /// This class is an extension of \c GraphSkeleton. It also makes it
    1.16      /// possible to erase edges or nodes.
    1.17 -    class EraseableGraphSkeleton : public GraphSkeleton
    1.18 +    class ErasableGraphSkeleton : public GraphSkeleton
    1.19      {
    1.20      public:
    1.21        /// Defalult constructor.
    1.22  
    1.23        /// Defalult constructor.
    1.24        ///
    1.25 -      EraseableGraphSkeleton() { }
    1.26 +      ErasableGraphSkeleton() { }
    1.27        /// Deletes a node.
    1.28  
    1.29        /// Deletes node \c n node.

     2.1 --- a/src/test/graph_test.cc	Thu Sep 09 07:09:41 2004 +0000
     2.2 +++ b/src/test/graph_test.cc	Thu Sep 09 09:18:41 2004 +0000
     2.3 @@ -58,8 +58,8 @@
     2.4  template void checkCompileGraph<skeleton::GraphSkeleton>
     2.5  (skeleton::GraphSkeleton &);
     2.6  
     2.7 -template void checkCompileErasableGraph<skeleton::EraseableGraphSkeleton>
     2.8 -(skeleton::EraseableGraphSkeleton &);
     2.9 +template void checkCompileErasableGraph<skeleton::ErasableGraphSkeleton>
    2.10 +(skeleton::ErasableGraphSkeleton &);
    2.11  
    2.12  //Compile SmartGraph
    2.13  template void checkCompileGraph<SmartGraph>(SmartGraph &);

     3.1 --- a/src/work/marci/graph_concept.h	Thu Sep 09 07:09:41 2004 +0000
     3.2 +++ b/src/work/marci/graph_concept.h	Thu Sep 09 09:18:41 2004 +0000
     3.3 @@ -399,11 +399,11 @@
     3.4    };
     3.5  
     3.6  
     3.7 -  /// \brief Node-eraseable graph concept.
     3.8 +  /// \brief Node-erasable graph concept.
     3.9    ///
    3.10    /// A graph class which provides a function to 
    3.11    /// delete any of its nodes.
    3.12 -  class NodeEraseableGraphConcept : virtual public GraphConcept
    3.13 +  class NodeErasableGraphConcept : virtual public GraphConcept
    3.14    {
    3.15    public:
    3.16      /// Deletes a node.
    3.17 @@ -411,11 +411,11 @@
    3.18    };
    3.19  
    3.20  
    3.21 -  /// \brief Edge-eraseable graph concept.
    3.22 +  /// \brief Edge-erasable graph concept.
    3.23    /// 
    3.24    /// A graph class which provides a function to delete any 
    3.25    /// of its edges.
    3.26 -  class EdgeEraseableGraphConcept : virtual public GraphConcept
    3.27 +  class EdgeErasableGraphConcept : virtual public GraphConcept
    3.28    {
    3.29    public:
    3.30      /// Deletes a node.

     4.1 --- a/src/work/peter/edgepathgraph.h	Thu Sep 09 07:09:41 2004 +0000
     4.2 +++ b/src/work/peter/edgepathgraph.h	Thu Sep 09 09:18:41 2004 +0000
     4.3 @@ -364,9 +364,9 @@
     4.4      };
     4.5    };
     4.6  
     4.7 -  /// An empty eraseable graph class.
     4.8 +  /// An empty erasable graph class.
     4.9    
    4.10 -  /// This class provides all the common features of an \e eraseable graph
    4.11 +  /// This class provides all the common features of an \e erasable graph
    4.12    /// structure,
    4.13    /// however completely without implementations and real data structures
    4.14    /// behind the interface.
    4.15 @@ -384,7 +384,7 @@
    4.16    /// like @ref ListGraph or
    4.17    /// @ref SmartGraph will just refer to this structure.
    4.18    template <typename P, typename Gact, typename Gsub>
    4.19 -  class EraseableEdgePathGraph : public EdgePathGraph<P, Gact, Gsub>
    4.20 +  class ErasableEdgePathGraph : public EdgePathGraph<P, Gact, Gsub>
    4.21    {
    4.22    public:
    4.23      /// Deletes a node.
    4.24 @@ -393,9 +393,9 @@
    4.25      void erase(typename Gact::Edge e) {actuallayer.erase(e);}
    4.26  
    4.27      /// Defalult constructor.
    4.28 -    EraseableEdgePathGraph() {}
    4.29 +    ErasableEdgePathGraph() {}
    4.30      ///Copy consructor.
    4.31 -    EraseableEdgePathGraph(const EdgePathGraph<P, Gact, Gsub> &EPG) {}
    4.32 +    ErasableEdgePathGraph(const EdgePathGraph<P, Gact, Gsub> &EPG) {}
    4.33    };
    4.34  
    4.35    

     5.1 --- a/src/work/peter/hierarchygraph.h	Thu Sep 09 07:09:41 2004 +0000
     5.2 +++ b/src/work/peter/hierarchygraph.h	Thu Sep 09 09:18:41 2004 +0000
     5.3 @@ -527,9 +527,9 @@
     5.4      };
     5.5    };
     5.6  
     5.7 -  /// An empty eraseable graph class.
     5.8 +  /// An empty erasable graph class.
     5.9  
    5.10 -  /// This class provides all the common features of an \e eraseable graph
    5.11 +  /// This class provides all the common features of an \e erasable graph
    5.12    /// structure,
    5.13    /// however completely without implementations and real data structures
    5.14    /// behind the interface.
    5.15 @@ -546,7 +546,7 @@
    5.16    /// feature, the documentation of a real graph imlementation
    5.17    /// like @ref ListGraph or
    5.18    /// @ref SmartGraph will just refer to this structure.
    5.19 -template < typename Gact, typename Gsub > class EraseableHierarchyGraph:public HierarchyGraph < Gact,
    5.20 +template < typename Gact, typename Gsub > class ErasableHierarchyGraph:public HierarchyGraph < Gact,
    5.21      Gsub
    5.22      >
    5.23    {
    5.24 @@ -563,11 +563,11 @@
    5.25      }
    5.26  
    5.27      /// Defalult constructor.
    5.28 -    EraseableHierarchyGraph ()
    5.29 +    ErasableHierarchyGraph ()
    5.30      {
    5.31      }
    5.32      ///Copy consructor.
    5.33 -    EraseableHierarchyGraph (const HierarchyGraph < Gact, Gsub > &EPG)
    5.34 +    ErasableHierarchyGraph (const HierarchyGraph < Gact, Gsub > &EPG)
    5.35      {
    5.36      }
    5.37    };