1.1 --- a/lemon/concepts/graph_components.h	Tue Aug 18 10:08:28 2009 +0200
     1.2 +++ b/lemon/concepts/graph_components.h	Thu Nov 05 08:39:49 2009 +0100
     1.3 @@ -92,7 +92,7 @@
     1.4        /// It makes possible to use graph item types as key types in 
     1.5        /// associative containers (e.g. \c std::map).
     1.6        ///
     1.7 -      /// \note This operator only have to define some strict ordering of
     1.8 +      /// \note This operator only has to define some strict ordering of
     1.9        /// the items; this order has nothing to do with the iteration
    1.10        /// ordering of the items.
    1.11        bool operator<(const GraphItem&) const { return false; }