1.1 --- a/lemon/howard.h	Thu Nov 05 08:39:49 2009 +0100
     1.2 +++ b/lemon/howard.h	Thu Oct 15 12:55:41 2009 +0200
     1.3 @@ -97,7 +97,8 @@
     1.4    /// mean cycle.
     1.5    ///
     1.6    /// This class implements Howard's policy iteration algorithm for finding
     1.7 -  /// a directed cycle of minimum mean length (cost) in a digraph.
     1.8 +  /// a directed cycle of minimum mean length (cost) in a digraph
     1.9 +  /// \ref amo93networkflows, \ref dasdan98minmeancycle.
    1.10    /// This class provides the most efficient algorithm for the
    1.11    /// minimum mean cycle problem, though the best known theoretical
    1.12    /// bound on its running time is exponential.