1.1 --- a/src/work/peter/edgepathgraph.h	Thu Sep 09 07:09:41 2004 +0000
     1.2 +++ b/src/work/peter/edgepathgraph.h	Thu Sep 09 09:18:41 2004 +0000
     1.3 @@ -364,9 +364,9 @@
     1.4      };
     1.5    };
     1.6  
     1.7 -  /// An empty eraseable graph class.
     1.8 +  /// An empty erasable graph class.
     1.9    
    1.10 -  /// This class provides all the common features of an \e eraseable graph
    1.11 +  /// This class provides all the common features of an \e erasable graph
    1.12    /// structure,
    1.13    /// however completely without implementations and real data structures
    1.14    /// behind the interface.
    1.15 @@ -384,7 +384,7 @@
    1.16    /// like @ref ListGraph or
    1.17    /// @ref SmartGraph will just refer to this structure.
    1.18    template <typename P, typename Gact, typename Gsub>
    1.19 -  class EraseableEdgePathGraph : public EdgePathGraph<P, Gact, Gsub>
    1.20 +  class ErasableEdgePathGraph : public EdgePathGraph<P, Gact, Gsub>
    1.21    {
    1.22    public:
    1.23      /// Deletes a node.
    1.24 @@ -393,9 +393,9 @@
    1.25      void erase(typename Gact::Edge e) {actuallayer.erase(e);}
    1.26  
    1.27      /// Defalult constructor.
    1.28 -    EraseableEdgePathGraph() {}
    1.29 +    ErasableEdgePathGraph() {}
    1.30      ///Copy consructor.
    1.31 -    EraseableEdgePathGraph(const EdgePathGraph<P, Gact, Gsub> &EPG) {}
    1.32 +    ErasableEdgePathGraph(const EdgePathGraph<P, Gact, Gsub> &EPG) {}
    1.33    };
    1.34  
    1.35