# Changeset 880:38213abd2911 in lemon-1.2 for doc/groups.dox

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

Small doc fixes and improvements (#359)

File:
1 edited

Unmodified
Removed
• ## doc/groups.dox

 r877 /** @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. */
Note: See TracChangeset for help on using the changeset viewer.