Changeset 959:38213abd2911 in lemon
 Timestamp:
 03/18/10 00:30:25 (9 years ago)
 Branch:
 default
 Phase:
 public
 Files:

 4 edited
Legend:
 Unmodified
 Added
 Removed

LICENSE
r600 r959 2 2 copyright/license. 3 3 4 Copyright (C) 200320 09Egervary Jeno Kombinatorikus Optimalizalasi4 Copyright (C) 20032010 Egervary Jeno Kombinatorikus Optimalizalasi 5 5 Kutatocsoport (Egervary Combinatorial Optimization Research Group, 6 6 EGRES). 
doc/groups.dox
r956 r959 264 264 265 265 /** 266 @defgroup matrices Matrices267 @ingroup datas268 \brief Two dimensional data storages implemented in LEMON.269 270 This group contains two dimensional data storages implemented in LEMON.271 */272 273 /**274 266 @defgroup auxdat Auxiliary Data Structures 275 267 @ingroup datas … … 473 465 474 466 LEMON contains three algorithms for solving the minimum mean cycle problem: 475  \ref Karp "Karp"'s original algorithm \ref amo93networkflows,467  \ref KarpMmc Karp's original algorithm \ref amo93networkflows, 476 468 \ref dasdan98minmeancycle. 477  \ref HartmannOrlin "HartmannOrlin"'s algorithm, which is an improved469  \ref HartmannOrlinMmc HartmannOrlin's algorithm, which is an improved 478 470 version of Karp's algorithm \ref dasdan98minmeancycle. 479  \ref Howard "Howard"'s policy iteration algorithm471  \ref HowardMmc Howard's policy iteration algorithm 480 472 \ref dasdan98minmeancycle. 481 473 482 In practice, the Howard algorithm proved to be by far the most efficient483 one, though the best known theoretical bound on its running time is 484 exponential.485 Both Karp and HartmannOrlin algorithms run in time O(ne) and use space486 O(n<sup>2</sup>+e), but the latter one is typically faster due to the 487 applied early termination scheme.474 In practice, the \ref HowardMmc "Howard" algorithm proved to be by far the 475 most efficient one, though the best known theoretical bound on its running 476 time is exponential. 477 Both \ref KarpMmc "Karp" and \ref HartmannOrlinMmc "HartmannOrlin" algorithms 478 run in time O(ne) and use space O(n<sup>2</sup>+e), but the latter one is 479 typically faster due to the applied early termination scheme. 488 480 */ 489 481 
lemon/arg_parser.h
r956 r959 36 36 37 37 ///Exception used by ArgParser 38 39 ///Exception used by ArgParser. 40 /// 38 41 class ArgParserException : public Exception { 39 42 public: 43 /// Reasons for failure 44 45 /// Reasons for failure. 46 /// 40 47 enum Reason { 41 HELP, /// <tt>help</tt> option was given42 UNKNOWN_OPT, /// Unknown option was given43 INVALID_OPT /// Invalid combination of options48 HELP, ///< <tt>help</tt> option was given. 49 UNKNOWN_OPT, ///< Unknown option was given. 50 INVALID_OPT ///< Invalid combination of options. 44 51 }; 45 52 
lemon/hartmann_orlin_mmc.h
r956 r959 39 39 /// \tparam GR The type of the digraph. 40 40 /// \tparam CM The type of the cost map. 41 /// It must conform to the \ref concepts::Rea _data "Rea_data" concept.41 /// It must conform to the \ref concepts::ReadMap "ReadMap" concept. 42 42 #ifdef DOXYGEN 43 43 template <typename GR, typename CM> … … 100 100 /// a directed cycle of minimum mean cost in a digraph 101 101 /// \ref amo93networkflows, \ref dasdan98minmeancycle. 102 /// It is an improved version of \ref Karp "Karp"'s original algorithm,102 /// It is an improved version of \ref KarpMmc "Karp"'s original algorithm, 103 103 /// it applies an efficient early termination scheme. 104 104 /// It runs in time O(ne) and uses space O(n<sup>2</sup>+e).
Note: See TracChangeset
for help on using the changeset viewer.