1.1 --- a/lemon/euler.h	Fri Apr 20 14:47:19 2007 +0000
     1.2 +++ b/lemon/euler.h	Fri Apr 20 14:49:21 2007 +0000
     1.3 @@ -20,7 +20,7 @@
     1.4  #include<lemon/topology.h>
     1.5  #include <list>
     1.6  
     1.7 -/// \ingroup topology
     1.8 +/// \ingroup graph_prop
     1.9  /// \file
    1.10  /// \brief Euler tour
    1.11  ///
    1.12 @@ -32,7 +32,7 @@
    1.13  
    1.14    ///Euler iterator for directed graphs.
    1.15  
    1.16 -  /// \ingroup topology
    1.17 +  /// \ingroup graph_prop
    1.18    ///This iterator converts to the \c Edge type of the graph and using
    1.19    ///operator ++ it provides an Euler tour of a \e directed
    1.20    ///graph (if there exists).
    1.21 @@ -120,7 +120,7 @@
    1.22  
    1.23    ///Euler iterator for undirected graphs.
    1.24  
    1.25 -  /// \ingroup topology
    1.26 +  /// \ingroup graph_prop
    1.27    ///This iterator converts to the \c Edge (or \c UEdge)
    1.28    ///type of the graph and using
    1.29    ///operator ++ it provides an Euler tour of an undirected
    1.30 @@ -218,7 +218,7 @@
    1.31  
    1.32    ///Checks if the graph is Euler
    1.33  
    1.34 -  /// \ingroup topology
    1.35 +  /// \ingroup graph_prop
    1.36    ///Checks if the graph is Euler. It works for both directed and
    1.37    ///undirected graphs.
    1.38    ///\note By definition, a directed graph is called \e Euler if