[Lemon-commits] [lemon_svn] alpar: r2094 - in hugo/trunk: doc lemon

[Lemon SVN]

Author: alpar
Date: Tue Jul 26 22:12:36 2005
New Revision: 2094

Modified:
   hugo/trunk/doc/adaptor_references.dox
   hugo/trunk/lemon/graph_utils.h
   hugo/trunk/lemon/matrix_graph.h

Log:
Spellcheck

Modified: hugo/trunk/doc/adaptor_references.dox
==============================================================================
--- hugo/trunk/doc/adaptor_references.dox	(original)
+++ hugo/trunk/doc/adaptor_references.dox	Tue Jul 26 22:12:36 2005
@@ -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 

Modified: hugo/trunk/lemon/graph_utils.h
==============================================================================
--- hugo/trunk/lemon/graph_utils.h	(original)
+++ hugo/trunk/lemon/graph_utils.h	Tue Jul 26 22:12:36 2005
@@ -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) {
   ///   ...

Modified: hugo/trunk/lemon/matrix_graph.h
==============================================================================
--- hugo/trunk/lemon/matrix_graph.h	(original)
+++ hugo/trunk/lemon/matrix_graph.h	Tue Jul 26 22:12:36 2005
@@ -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);