summary |
shortlog |
changelog |
graph |
tags |
bookmarks |
branches |
files |
changeset |
file |
latest |
revisions |
annotate |
diff |
comparison |
raw |
help

doc/groups.dox

branch | 1.2 |

changeset 963 | 3ed8f7c8bed8 |

parent 961 | 7af2ae7c1428 |

parent 959 | 38213abd2911 |

1.1 --- a/doc/groups.dox Thu Mar 18 00:29:35 2010 +0100 1.2 +++ b/doc/groups.dox Thu Mar 18 14:50:32 2010 +0100 1.3 @@ -263,14 +263,6 @@ 1.4 */ 1.5 1.6 /** 1.7 -@defgroup matrices Matrices 1.8 -@ingroup datas 1.9 -\brief Two dimensional data storages implemented in LEMON. 1.10 - 1.11 -This group contains two dimensional data storages implemented in LEMON. 1.12 -*/ 1.13 - 1.14 -/** 1.15 @defgroup auxdat Auxiliary Data Structures 1.16 @ingroup datas 1.17 \brief Auxiliary data structures implemented in LEMON. 1.18 @@ -448,19 +440,19 @@ 1.19 function. 1.20 1.21 LEMON contains three algorithms for solving the minimum mean cycle problem: 1.22 -- \ref Karp "Karp"'s original algorithm \ref amo93networkflows, 1.23 +- \ref KarpMmc Karp's original algorithm \ref amo93networkflows, 1.24 \ref dasdan98minmeancycle. 1.25 -- \ref HartmannOrlin "Hartmann-Orlin"'s algorithm, which is an improved 1.26 +- \ref HartmannOrlinMmc Hartmann-Orlin's algorithm, which is an improved 1.27 version of Karp's algorithm \ref dasdan98minmeancycle. 1.28 -- \ref Howard "Howard"'s policy iteration algorithm 1.29 +- \ref HowardMmc Howard's policy iteration algorithm 1.30 \ref dasdan98minmeancycle. 1.31 1.32 -In practice, the Howard algorithm proved to be by far the most efficient 1.33 -one, though the best known theoretical bound on its running time is 1.34 -exponential. 1.35 -Both Karp and HartmannOrlin algorithms run in time O(ne) and use space 1.36 -O(n<sup>2</sup>+e), but the latter one is typically faster due to the 1.37 -applied early termination scheme. 1.38 +In practice, the \ref HowardMmc "Howard" algorithm proved to be by far the 1.39 +most efficient one, though the best known theoretical bound on its running 1.40 +time is exponential. 1.41 +Both \ref KarpMmc "Karp" and \ref HartmannOrlinMmc "Hartmann-Orlin" algorithms 1.42 +run in time O(ne) and use space O(n<sup>2</sup>+e), but the latter one is 1.43 +typically faster due to the applied early termination scheme. 1.44 */ 1.45 1.46 /**