1.1 --- a/lemon/concepts/graph_components.h	Sun Oct 04 10:15:32 2009 +0200
     1.2 +++ b/lemon/concepts/graph_components.h	Wed Dec 09 11:14:06 2009 +0100
     1.3 @@ -18,7 +18,7 @@
     1.4  
     1.5  ///\ingroup graph_concepts
     1.6  ///\file
     1.7 -///\brief The concept of graph components.
     1.8 +///\brief The concepts of graph components.
     1.9  
    1.10  #ifndef LEMON_CONCEPTS_GRAPH_COMPONENTS_H
    1.11  #define LEMON_CONCEPTS_GRAPH_COMPONENTS_H
    1.12 @@ -92,7 +92,7 @@
    1.13        /// It makes possible to use graph item types as key types in 
    1.14        /// associative containers (e.g. \c std::map).
    1.15        ///
    1.16 -      /// \note This operator only have to define some strict ordering of
    1.17 +      /// \note This operator only has to define some strict ordering of
    1.18        /// the items; this order has nothing to do with the iteration
    1.19        /// ordering of the items.
    1.20        bool operator<(const GraphItem&) const { return false; }