COIN-OR::LEMON - Graph Library

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


Ignore:
Timestamp:
08/12/09 09:45:15 (10 years ago)
Author:
Peter Kovacs <kpeter@…>
Branch:
default
Phase:
public
Message:

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

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/hartmann_orlin.h

    r814 r815  
    2020#define LEMON_HARTMANN_ORLIN_H
    2121
    22 /// \ingroup shortest_path
     22/// \ingroup min_mean_cycle
    2323///
    2424/// \file
     
    9191
    9292
    93   /// \addtogroup shortest_path
     93  /// \addtogroup min_mean_cycle
    9494  /// @{
    9595
     
    9999  /// This class implements the Hartmann-Orlin algorithm for finding
    100100  /// a directed cycle of minimum mean length (cost) in a digraph.
    101   /// It is an improved version of \ref Karp "Karp's original algorithm",
     101  /// It is an improved version of \ref Karp "Karp"'s original algorithm,
    102102  /// it applies an efficient early termination scheme.
     103  /// It runs in time O(ne) and uses space O(n<sup>2</sup>+e).
    103104  ///
    104105  /// \tparam GR The type of the digraph the algorithm runs on.
Note: See TracChangeset for help on using the changeset viewer.