lemon-0.x: comparison src/work/peter/hierarchygraph.h

equal deleted inserted replaced

-:7db3aa3cd0f2
+:74763cadb253
 {
 }				//FIXME: Is it necessary
 };
 };
-/// An empty eraseable graph class.
+/// An empty erasable graph class.
-/// This class provides all the common features of an \e eraseable graph
+/// This class provides all the common features of an \e erasable graph
 /// structure,
 /// however completely without implementations and real data structures
 /// behind the interface.
 /// All graph algorithms should compile with this class, but it will not
 /// run properly, of course.
 ///
 /// Also, you will find here the full documentation of a certain graph
 /// feature, the documentation of a real graph imlementation
 /// like @ref ListGraph or
 /// @ref SmartGraph will just refer to this structure.
-template < typename Gact, typename Gsub > class EraseableHierarchyGraph:public HierarchyGraph < Gact,
+template < typename Gact, typename Gsub > class ErasableHierarchyGraph:public HierarchyGraph < Gact,
 Gsub
 >
 {
 public:
 /// Deletes a node.
 {
 actuallayer.erase (e);
 }
 /// Defalult constructor.
-EraseableHierarchyGraph ()
+ErasableHierarchyGraph ()
 {
 }
 ///Copy consructor.
-EraseableHierarchyGraph (const HierarchyGraph < Gact, Gsub > &EPG)
+ErasableHierarchyGraph (const HierarchyGraph < Gact, Gsub > &EPG)
 {
 }
 };