1.1 --- a/lemon/hartmann_orlin.h Tue Aug 11 22:52:35 2009 +0200
1.2 +++ b/lemon/hartmann_orlin.h Wed Aug 12 09:45:15 2009 +0200
1.3 @@ -19,7 +19,7 @@
1.4 #ifndef LEMON_HARTMANN_ORLIN_H
1.5 #define LEMON_HARTMANN_ORLIN_H
1.6
1.7 -/// \ingroup shortest_path
1.8 +/// \ingroup min_mean_cycle
1.9 ///
1.10 /// \file
1.11 /// \brief Hartmann-Orlin'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 the Hartmann-Orlin algorithm for finding
1.21 @@ -98,8 +98,9 @@
1.22 ///
1.23 /// This class implements the Hartmann-Orlin algorithm for finding
1.24 /// a directed cycle of minimum mean length (cost) in a digraph.
1.25 - /// It is an improved version of \ref Karp "Karp's original algorithm",
1.26 + /// It is an improved version of \ref Karp "Karp"'s original algorithm,
1.27 /// it applies an efficient early termination scheme.
1.28 + /// It runs in time O(ne) and uses space O(n<sup>2</sup>+e).
1.29 ///
1.30 /// \tparam GR The type of the digraph the algorithm runs on.
1.31 /// \tparam LEN The type of the length map. The default