diff -r ba2cb5006358 -r 03aa0a6c8dca lemon/graph_utils.h
--- a/lemon/graph_utils.h	Tue Jul 26 20:12:36 2005 +0000
+++ b/lemon/graph_utils.h	Tue Jul 26 20:14:03 2005 +0000
@@ -217,7 +217,7 @@
   ///
   /// Iterator for iterating on edges connected the same nodes. It is 
   /// higher level interface for the findEdge() function. You can
-  /// use it the following was:
+  /// use it the following way:
   /// \code
   /// for (ConEdgeIt<Graph> it(g, src, trg); it != INVALID; ++it) {
   ///   ...