# HG changeset patch
# User alpar
# Date 1122408756 0
# Node ID ba2cb50063583b76c0773f0c69d889a810d54e06
# Parent  9192e1b26d329617bf230a8c207b173a271e6b43
Spellcheck

diff -r 9192e1b26d32 -r ba2cb5006358 doc/adaptor_references.dox
--- a/doc/adaptor_references.dox	Tue Jul 26 18:14:23 2005 +0000
+++ b/doc/adaptor_references.dox	Tue Jul 26 20:12:36 2005 +0000
@@ -11,7 +11,7 @@
 \section problem The problem
 
 The adaptors usually use references or pointers to reference to an 
-existing data structure. We may use an algorithm in the next way:
+existing data structure. We may use an algorithm in the following was:
 \code
 function_algorithm(adaptor(structure));
 \endcode 
diff -r 9192e1b26d32 -r ba2cb5006358 lemon/graph_utils.h
--- a/lemon/graph_utils.h	Tue Jul 26 18:14:23 2005 +0000
+++ b/lemon/graph_utils.h	Tue Jul 26 20:12:36 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 next way:
+  /// use it the following was:
   /// \code
   /// for (ConEdgeIt<Graph> it(g, src, trg); it != INVALID; ++it) {
   ///   ...
diff -r 9192e1b26d32 -r ba2cb5006358 lemon/matrix_graph.h
--- a/lemon/matrix_graph.h	Tue Jul 26 18:14:23 2005 +0000
+++ b/lemon/matrix_graph.h	Tue Jul 26 20:12:36 2005 +0000
@@ -261,7 +261,7 @@
   /// Two nodes are connected in the graph if the indices differ only
   /// on one position and only one is the difference. 
   ///
-  /// The graph can be indiced in the next way:
+  /// The graph can be indiced in the following was:
   /// \code
   /// MatrixGraph graph(h, w);
   /// MatrixGraph::NodeMap<int> val(graph);