1.1 --- a/lemon/graph_utils.h	Thu May 18 08:12:54 2006 +0000
     1.2 +++ b/lemon/graph_utils.h	Thu May 18 09:32:36 2006 +0000
     1.3 @@ -1198,9 +1198,9 @@
     1.4        const InvertableMap& inverted;
     1.5      };
     1.6  
     1.7 -    /// \brief It gives back the just readeable inverse map.
     1.8 +    /// \brief It gives back the just readable inverse map.
     1.9      ///
    1.10 -    /// It gives back the just readeable inverse map.
    1.11 +    /// It gives back the just readable inverse map.
    1.12      InverseMap inverse() const {
    1.13        return InverseMap(*this);
    1.14      } 

     2.1 --- a/lemon/min_cut.h	Thu May 18 08:12:54 2006 +0000
     2.2 +++ b/lemon/min_cut.h	Thu May 18 09:32:36 2006 +0000
     2.3 @@ -701,7 +701,7 @@
     2.4      /// The graph type the algorithm runs on. 
     2.5      typedef _Graph Graph;
     2.6  
     2.7 -    /// The AuxGraph type which is an EraseableGraph
     2.8 +    /// The AuxGraph type which is an ErasableGraph
     2.9      typedef ListUGraph AuxGraph;
    2.10  
    2.11      /// \brief Instantiates a AuxGraph.