1.1 --- a/doc/adaptor_references.dox	Tue Jul 26 20:12:36 2005 +0000
     1.2 +++ b/doc/adaptor_references.dox	Tue Jul 26 20:14:03 2005 +0000
     1.3 @@ -11,7 +11,7 @@
     1.4  \section problem The problem
     1.5  
     1.6  The adaptors usually use references or pointers to reference to an 
     1.7 -existing data structure. We may use an algorithm in the following was:
     1.8 +existing data structure. We may use an algorithm in the following way:
     1.9  \code
    1.10  function_algorithm(adaptor(structure));
    1.11  \endcode 

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

     3.1 --- a/lemon/matrix_graph.h	Tue Jul 26 20:12:36 2005 +0000
     3.2 +++ b/lemon/matrix_graph.h	Tue Jul 26 20:14:03 2005 +0000
     3.3 @@ -261,7 +261,7 @@
     3.4    /// Two nodes are connected in the graph if the indices differ only
     3.5    /// on one position and only one is the difference. 
     3.6    ///
     3.7 -  /// The graph can be indiced in the following was:
     3.8 +  /// The graph can be indiced in the following way:
     3.9    /// \code
    3.10    /// MatrixGraph graph(h, w);
    3.11    /// MatrixGraph::NodeMap<int> val(graph);