1.1 --- a/lemon/euler.h	Wed Nov 16 09:15:41 2005 +0000
     1.2 +++ b/lemon/euler.h	Wed Nov 16 13:15:33 2005 +0000
     1.3 @@ -30,12 +30,12 @@
     1.4  
     1.5    /// \ingroup topology
     1.6    ///This iterator converts to the \c Edge type of the graph and using
     1.7 -  ///the ++ operator it provides an Euler tour of the graph (if there exists).
     1.8 +  ///operator ++ it provides an Euler tour of the graph (if there exists).
     1.9    ///
    1.10    ///For example
    1.11    ///if the given graph if Euler (i.e it has only one nontrivial component
    1.12    ///and the in-degree is equal to the out-degree for all nodes),
    1.13 -  ///the the following code will print the edge IDs according to an
    1.14 +  ///the following code will print the edge IDs according to an
    1.15    ///Euler tour of \c g.
    1.16    ///\code
    1.17    ///  for(EulerIt<ListGraph> e(g),e!=INVALID;++e) {
    1.18 @@ -64,7 +64,7 @@
    1.19  
    1.20      ///\param _g A directed graph.
    1.21      ///\param start The starting point of the tour. If it is not given
    1.22 -    ///       tho tour will start from the first node.
    1.23 +    ///       the tour will start from the first node.
    1.24      EulerIt(const Graph &_g,typename Graph::Node start=INVALID)
    1.25        : g(_g), nedge(g)
    1.26      {
    1.27 @@ -100,7 +100,9 @@
    1.28      }
    1.29      ///Postfix incrementation
    1.30      
    1.31 -    ///\warning This gives back an Edge, not an EulerIt!
    1.32 +    ///\warning This incrementation
    1.33 +    ///returns an \c Edge, not an \ref EulerIt, as one may
    1.34 +    ///expect.
    1.35      Edge operator++(int) 
    1.36      {
    1.37        Edge e=*this;