1.1 --- a/lemon/graph_utils.h	Mon Jan 22 12:13:57 2007 +0000
     1.2 +++ b/lemon/graph_utils.h	Tue Jan 23 12:51:39 2007 +0000
     1.3 @@ -397,7 +397,7 @@
     1.4    /// 
     1.5    ///\sa findEdge()
     1.6    ///\sa EdgeLookUp
     1.7 -  ///\se AllEdgeLookup
     1.8 +  ///\sa AllEdgeLookup
     1.9    ///
    1.10    /// \author Balazs Dezso 
    1.11    template <typename _Graph>
    1.12 @@ -2661,7 +2661,7 @@
    1.13      ///\param t The target node
    1.14      ///\param prev The previous edge between \c s and \c t. It it is INVALID or
    1.15      ///not given, the operator finds the first appropriate edge.
    1.16 -    ///\return An edge from \c s to \c t after \prev or
    1.17 +    ///\return An edge from \c s to \c t after \c prev or
    1.18      ///\ref INVALID if there is no more.
    1.19      ///
    1.20      ///For example, you can count the number of edges from \c u to \c v in the