lemon/euler.h
 changeset 633 7c12061bd271 parent 606 c5fd2d996909 child 638 493533ead9df
```     1.1 --- a/lemon/euler.h	Tue Apr 14 10:40:33 2009 +0100
1.2 +++ b/lemon/euler.h	Wed Apr 15 04:26:13 2009 +0200
1.3 @@ -24,7 +24,7 @@
1.4  #include<lemon/connectivity.h>
1.5  #include <list>
1.6
1.7 -/// \ingroup graph_prop
1.8 +/// \ingroup graph_properties
1.9  /// \file
1.10  /// \brief Euler tour
1.11  ///
1.12 @@ -36,7 +36,7 @@
1.13
1.14    ///Euler iterator for digraphs.
1.15
1.16 -  /// \ingroup graph_prop
1.17 +  /// \ingroup graph_properties
1.18    ///This iterator converts to the \c Arc type of the digraph and using
1.19    ///operator ++, it provides an Euler tour of a \e directed
1.20    ///graph (if there exists).
1.21 @@ -123,7 +123,7 @@
1.22
1.23    ///Euler iterator for graphs.
1.24
1.25 -  /// \ingroup graph_prop
1.26 +  /// \ingroup graph_properties
1.27    ///This iterator converts to the \c Arc (or \c Edge)
1.28    ///type of the digraph and using
1.29    ///operator ++, it provides an Euler tour of an undirected
1.30 @@ -228,7 +228,7 @@
1.31
1.32    ///Checks if the graph is Eulerian
1.33
1.34 -  /// \ingroup graph_prop
1.35 +  /// \ingroup graph_properties
1.36    ///Checks if the graph is Eulerian. It works for both directed and undirected
1.37    ///graphs.
1.38    ///\note By definition, a digraph is called \e Eulerian if
```