diff -r 3af83b6be1df -r 22f932bbb305 lemon/euler.h
--- a/lemon/euler.h	Mon Feb 23 11:30:15 2009 +0000
+++ b/lemon/euler.h	Mon Nov 03 11:59:54 2008 +0000
@@ -54,7 +54,6 @@
   ///\endcode
   ///If \c g is not Euler then the resulted tour will not be full or closed.
   ///\sa EulerIt
-  ///\todo Test required
   template<class Digraph>
   class DiEulerIt
   {
@@ -146,7 +145,6 @@
   ///
   ///If \c g is not Euler then the resulted tour will not be full or closed.
   ///\sa EulerIt
-  ///\todo Test required
   template<class Digraph>
   class EulerIt
   {
@@ -240,7 +238,6 @@
   ///and only if it is connected and the number of incident arcs is even
   ///for each node. <em>Therefore, there are digraphs which are not Eulerian,
   ///but still have an Euler tour</em>.
-  ///\todo Test required
   template<class Digraph>
 #ifdef DOXYGEN
   bool