1.1 --- a/lemon/howard.h	Tue Aug 11 22:52:35 2009 +0200
     1.2 +++ b/lemon/howard.h	Wed Aug 12 09:45:15 2009 +0200
     1.3 @@ -19,7 +19,7 @@
     1.4  #ifndef LEMON_HOWARD_H
     1.5  #define LEMON_HOWARD_H
     1.6  
     1.7 -/// \ingroup shortest_path
     1.8 +/// \ingroup min_mean_cycle
     1.9  ///
    1.10  /// \file
    1.11  /// \brief Howard's algorithm for finding a minimum mean cycle.
    1.12 @@ -90,7 +90,7 @@
    1.13    };
    1.14  
    1.15  
    1.16 -  /// \addtogroup shortest_path
    1.17 +  /// \addtogroup min_mean_cycle
    1.18    /// @{
    1.19  
    1.20    /// \brief Implementation of Howard's algorithm for finding a minimum
    1.21 @@ -98,6 +98,9 @@
    1.22    ///
    1.23    /// This class implements Howard's policy iteration algorithm for finding
    1.24    /// a directed cycle of minimum mean length (cost) in a digraph.
    1.25 +  /// This class provides the most efficient algorithm for the
    1.26 +  /// minimum mean cycle problem, though the best known theoretical
    1.27 +  /// bound on its running time is exponential.
    1.28    ///
    1.29    /// \tparam GR The type of the digraph the algorithm runs on.
    1.30    /// \tparam LEN The type of the length map. The default