# Changeset 959:38213abd2911 in lemon

Ignore:
Timestamp:
03/18/10 00:30:25 (10 years ago)
Branch:
default
Phase:
public
Message:

Small doc fixes and improvements (#359)

Files:
4 edited

### Legend:

Unmodified
Removed

 r600 copyright/license. Copyright (C) 2003-2009 Egervary Jeno Kombinatorikus Optimalizalasi Copyright (C) 2003-2010 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport (Egervary Combinatorial Optimization Research Group, EGRES).
• ## doc/groups.dox

 r956 /** @defgroup matrices Matrices @ingroup datas \brief Two dimensional data storages implemented in LEMON. This group contains two dimensional data storages implemented in LEMON. */ /** @defgroup auxdat Auxiliary Data Structures @ingroup datas LEMON contains three algorithms for solving the minimum mean cycle problem: - \ref Karp "Karp"'s original algorithm \ref amo93networkflows, - \ref KarpMmc Karp's original algorithm \ref amo93networkflows, \ref dasdan98minmeancycle. - \ref HartmannOrlin "Hartmann-Orlin"'s algorithm, which is an improved - \ref HartmannOrlinMmc Hartmann-Orlin's algorithm, which is an improved version of Karp's algorithm \ref dasdan98minmeancycle. - \ref Howard "Howard"'s policy iteration algorithm - \ref HowardMmc Howard's policy iteration algorithm \ref dasdan98minmeancycle. In practice, the Howard algorithm proved to be by far the most efficient one, though the best known theoretical bound on its running time is exponential. Both Karp and HartmannOrlin algorithms run in time O(ne) and use space O(n2+e), but the latter one is typically faster due to the applied early termination scheme. In practice, the \ref HowardMmc "Howard" algorithm proved to be by far the most efficient one, though the best known theoretical bound on its running time is exponential. Both \ref KarpMmc "Karp" and \ref HartmannOrlinMmc "Hartmann-Orlin" algorithms run in time O(ne) and use space O(n2+e), but the latter one is typically faster due to the applied early termination scheme. */
• ## lemon/arg_parser.h

 r956 ///Exception used by ArgParser ///Exception used by ArgParser. /// class ArgParserException : public Exception { public: /// Reasons for failure /// Reasons for failure. /// enum Reason { HELP,         /// --help option was given UNKNOWN_OPT,  /// Unknown option was given INVALID_OPT   /// Invalid combination of options HELP,         ///< --help option was given. UNKNOWN_OPT,  ///< Unknown option was given. INVALID_OPT   ///< Invalid combination of options. };
• ## lemon/hartmann_orlin_mmc.h

 r956 /// \tparam GR The type of the digraph. /// \tparam CM The type of the cost map. /// It must conform to the \ref concepts::Rea_data "Rea_data" concept. /// It must conform to the \ref concepts::ReadMap "ReadMap" concept. #ifdef DOXYGEN template /// a directed cycle of minimum mean cost in a digraph /// \ref amo93networkflows, \ref dasdan98minmeancycle. /// It is an improved version of \ref Karp "Karp"'s original algorithm, /// It is an improved version of \ref KarpMmc "Karp"'s original algorithm, /// it applies an efficient early termination scheme. /// It runs in time O(ne) and uses space O(n2+e).
Note: See TracChangeset for help on using the changeset viewer.