1.1 --- a/lemon/euler.h	Wed Mar 17 12:35:52 2010 +0100
     1.2 +++ b/lemon/euler.h	Sat Mar 06 14:35:12 2010 +0000
     1.3 @@ -2,7 +2,7 @@
     1.4   *
     1.5   * This file is a part of LEMON, a generic C++ optimization library.
     1.6   *
     1.7 - * Copyright (C) 2003-2009
     1.8 + * Copyright (C) 2003-2010
     1.9   * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    1.10   * (Egervary Research Group on Combinatorial Optimization, EGRES).
    1.11   *
    1.12 @@ -26,7 +26,7 @@
    1.13  
    1.14  /// \ingroup graph_properties
    1.15  /// \file
    1.16 -/// \brief Euler tour iterators and a function for checking the \e Eulerian 
    1.17 +/// \brief Euler tour iterators and a function for checking the \e Eulerian
    1.18  /// property.
    1.19  ///
    1.20  ///This file provides Euler tour iterators and a function to check
    1.21 @@ -41,7 +41,7 @@
    1.22    ///graph (if there exists) and it converts to the \c Arc type of the digraph.
    1.23    ///
    1.24    ///For example, if the given digraph has an Euler tour (i.e it has only one
    1.25 -  ///non-trivial component and the in-degree is equal to the out-degree 
    1.26 +  ///non-trivial component and the in-degree is equal to the out-degree
    1.27    ///for all nodes), then the following code will put the arcs of \c g
    1.28    ///to the vector \c et according to an Euler tour of \c g.
    1.29    ///\code
    1.30 @@ -138,7 +138,7 @@
    1.31    ///\e undirected graph (if there exists) and it converts to the \c Arc
    1.32    ///and \c Edge types of the graph.
    1.33    ///
    1.34 -  ///For example, if the given graph has an Euler tour (i.e it has only one 
    1.35 +  ///For example, if the given graph has an Euler tour (i.e it has only one
    1.36    ///non-trivial component and the degree of each node is even),
    1.37    ///the following code will print the arc IDs according to an
    1.38    ///Euler tour of \c g.
    1.39 @@ -147,7 +147,7 @@
    1.40    ///    std::cout << g.id(Edge(e)) << std::eol;
    1.41    ///  }
    1.42    ///\endcode
    1.43 -  ///Although this iterator is for undirected graphs, it still returns 
    1.44 +  ///Although this iterator is for undirected graphs, it still returns
    1.45    ///arcs in order to indicate the direction of the tour.
    1.46    ///(But arcs convert to edges, of course.)
    1.47    ///
    1.48 @@ -233,7 +233,7 @@
    1.49  
    1.50      /// Postfix incrementation.
    1.51      ///
    1.52 -    ///\warning This incrementation returns an \c Arc (which converts to 
    1.53 +    ///\warning This incrementation returns an \c Arc (which converts to
    1.54      ///an \c Edge), not an \ref EulerIt, as one may expect.
    1.55      Arc operator++(int)
    1.56      {