diff -r 58c330ad0b5c -r 6be1f9bd2ac0 lemon/concepts/graph_components.h
--- a/lemon/concepts/graph_components.h	Sun Oct 04 10:15:32 2009 +0200
+++ b/lemon/concepts/graph_components.h	Wed Dec 09 11:14:06 2009 +0100
@@ -18,7 +18,7 @@
 
 ///\ingroup graph_concepts
 ///\file
-///\brief The concept of graph components.
+///\brief The concepts of graph components.
 
 #ifndef LEMON_CONCEPTS_GRAPH_COMPONENTS_H
 #define LEMON_CONCEPTS_GRAPH_COMPONENTS_H
@@ -92,7 +92,7 @@
       /// It makes possible to use graph item types as key types in 
       /// associative containers (e.g. \c std::map).
       ///
-      /// \note This operator only have to define some strict ordering of
+      /// \note This operator only has to define some strict ordering of
       /// the items; this order has nothing to do with the iteration
       /// ordering of the items.
       bool operator<(const GraphItem&) const { return false; }