Changeset 815:0a42883c8221 in lemon for lemon/hartmann_orlin.h

Timestamp:

08/12/09 09:45:15 (16 years ago)

Author:

Peter Kovacs <kpeter@…>

Branch:

default

Phase:

public

Message:

Separate group for the min mean cycle classes (#179)

File:

• lemon/hartmann_orlin.h (modified) (3 diffs)

lemon/hartmann_orlin.h

@@ -20 +20 @@
 #define LEMON_HARTMANN_ORLIN_H
 
-/// \ingroup shortest_path
+/// \ingroup min_mean_cycle
 ///
 /// \file
@@ -91 +91 @@
 
 
-  /// \addtogroup shortest_path
+  /// \addtogroup min_mean_cycle
   /// @{
 
@@ -99 +99 @@
   /// This class implements the Hartmann-Orlin algorithm for finding
   /// a directed cycle of minimum mean length (cost) in a digraph.
-  /// It is an improved version of \ref Karp "Karp's original algorithm",
+  /// It is an improved version of \ref Karp "Karp"'s original algorithm,
   /// it applies an efficient early termination scheme.
+  /// It runs in time O(ne) and uses space O(n<sup>2</sup>+e).
   ///
   /// \tparam GR The type of the digraph the algorithm runs on.