# HG changeset patch
# User deba
# Date 1131120623 0
# Node ID a67ec111236c27a61f3a943164472c2f2e8609c4
# Parent  1e2e0238e7c8dc38f5f646b93d2c6e7d406a66d8
Removed todo
Moved to topology module

diff -r 1e2e0238e7c8 -r a67ec111236c lemon/euler.h
--- a/lemon/euler.h	Fri Nov 04 15:59:21 2005 +0000
+++ b/lemon/euler.h	Fri Nov 04 16:10:23 2005 +0000
@@ -16,7 +16,7 @@
 #include<lemon/invalid.h>
 #include <list>
 
-/// \ingroup gutils
+/// \ingroup topology
 /// \file
 /// \brief Euler tour
 ///
@@ -28,7 +28,7 @@
 
   ///Euler iterator in directed graphs.
 
-  /// \ingroup gutils
+  /// \ingroup topology
   ///This iterator converts to the \c Edge type of the graph and using
   ///the ++ operator it provides an Euler tour of the graph (if there exists).
   ///
@@ -114,7 +114,6 @@
   /// \ingroup gutils
   ///Checks if the graph is Euler. It works for both directed and
   ///undirected graphs.
-  ///\todo What to do with the isolated points?
   ///\todo Test required
   template<class Graph>
 #ifdef DOXYGEN