1.1 --- a/lemon/euler.h	Mon Feb 23 11:30:15 2009 +0000
     1.2 +++ b/lemon/euler.h	Mon Nov 03 11:59:54 2008 +0000
     1.3 @@ -54,7 +54,6 @@
     1.4    ///\endcode
     1.5    ///If \c g is not Euler then the resulted tour will not be full or closed.
     1.6    ///\sa EulerIt
     1.7 -  ///\todo Test required
     1.8    template<class Digraph>
     1.9    class DiEulerIt
    1.10    {
    1.11 @@ -146,7 +145,6 @@
    1.12    ///
    1.13    ///If \c g is not Euler then the resulted tour will not be full or closed.
    1.14    ///\sa EulerIt
    1.15 -  ///\todo Test required
    1.16    template<class Digraph>
    1.17    class EulerIt
    1.18    {
    1.19 @@ -240,7 +238,6 @@
    1.20    ///and only if it is connected and the number of incident arcs is even
    1.21    ///for each node. <em>Therefore, there are digraphs which are not Eulerian,
    1.22    ///but still have an Euler tour</em>.
    1.23 -  ///\todo Test required
    1.24    template<class Digraph>
    1.25  #ifdef DOXYGEN
    1.26    bool