1.1 --- a/lemon/euler.h	Fri Nov 04 15:59:21 2005 +0000
     1.2 +++ b/lemon/euler.h	Fri Nov 04 16:10:23 2005 +0000
     1.3 @@ -16,7 +16,7 @@
     1.4  #include<lemon/invalid.h>
     1.5  #include <list>
     1.6  
     1.7 -/// \ingroup gutils
     1.8 +/// \ingroup topology
     1.9  /// \file
    1.10  /// \brief Euler tour
    1.11  ///
    1.12 @@ -28,7 +28,7 @@
    1.13  
    1.14    ///Euler iterator in directed graphs.
    1.15  
    1.16 -  /// \ingroup gutils
    1.17 +  /// \ingroup topology
    1.18    ///This iterator converts to the \c Edge type of the graph and using
    1.19    ///the ++ operator it provides an Euler tour of the graph (if there exists).
    1.20    ///
    1.21 @@ -114,7 +114,6 @@
    1.22    /// \ingroup gutils
    1.23    ///Checks if the graph is Euler. It works for both directed and
    1.24    ///undirected graphs.
    1.25 -  ///\todo What to do with the isolated points?
    1.26    ///\todo Test required
    1.27    template<class Graph>
    1.28  #ifdef DOXYGEN