1.1 --- a/lemon/concept/sym_graph.h	Wed Jun 29 19:44:30 2005 +0000
     1.2 +++ b/lemon/concept/sym_graph.h	Thu Jun 30 16:13:30 2005 +0000
     1.3 @@ -36,7 +36,7 @@
     1.4      /// This class provides all the common features of a symmetric
     1.5      /// graph structure, however completely without implementations and 
     1.6      /// real data structures behind the interface.
     1.7 -    /// All graph algorithms should compile with this class, but it will not
     1.8 +    /// All graph algorithms should compile with this class, but they will not
     1.9      /// run properly, of course.
    1.10      ///
    1.11      /// It can be used for checking the interface compatibility,
    1.12 @@ -51,7 +51,7 @@
    1.13      public:
    1.14        /// Defalult constructor.
    1.15  
    1.16 -      /// Defalult constructor.
    1.17 +      /// Default constructor.
    1.18        ///
    1.19        StaticSymGraph() { }
    1.20        ///Copy consructor.
    1.21 @@ -595,9 +595,9 @@
    1.22      class ExtendableSymGraph : public StaticSymGraph
    1.23      {
    1.24      public:
    1.25 -      /// Defalult constructor.
    1.26 +      /// Default constructor.
    1.27  
    1.28 -      /// Defalult constructor.
    1.29 +      /// Default constructor.
    1.30        ///
    1.31        ExtendableSymGraph() { }
    1.32        ///Add a new node to the graph.
    1.33 @@ -627,9 +627,9 @@
    1.34      class ErasableSymGraph : public ExtendableSymGraph
    1.35      {
    1.36      public:
    1.37 -      /// Defalult constructor.
    1.38 +      /// Default constructor.
    1.39  
    1.40 -      /// Defalult constructor.
    1.41 +      /// Default constructor.
    1.42        ///
    1.43        ErasableSymGraph() { }
    1.44        /// Deletes a node.