COIN-OR::LEMON - Graph Library

Changeset 815:0a42883c8221 in lemon for lemon/howard.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/howard.h

    r814 r815  
    2020#define LEMON_HOWARD_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 Howard's policy iteration algorithm for finding
    100100  /// a directed cycle of minimum mean length (cost) in a digraph.
     101  /// This class provides the most efficient algorithm for the
     102  /// minimum mean cycle problem, though the best known theoretical
     103  /// bound on its running time is exponential.
    101104  ///
    102105  /// \tparam GR The type of the digraph the algorithm runs on.
Note: See TracChangeset for help on using the changeset viewer.