Changes in lemon/hartmann_orlin_mmc.h [1164:f63ba40a60f4:1221:1c978b5bcc65] in lemon
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/hartmann_orlin_mmc.h
r1164 r1221 99 99 /// This class implements the HartmannOrlin algorithm for finding 100 100 /// a directed cycle of minimum mean cost in a digraph 101 /// \ref hartmann93finding, \ref dasdan98minmeancycle. 102 /// It is an improved version of \ref KarpMmc "Karp"'s original algorithm, 103 /// it applies an efficient early termination scheme. 104 /// It runs in time O(ne) and uses space O(n<sup>2</sup>+e). 101 /// \cite hartmann93finding, \cite dasdan98minmeancycle. 102 /// This method is based on \ref KarpMmc "Karp"'s original algorithm, but 103 /// applies an early termination scheme. It makes the algorithm 104 /// significantly faster for some problem instances, but slower for others. 105 /// The algorithm runs in time O(ne) and uses space O(n<sup>2</sup>+e). 105 106 /// 106 107 /// \tparam GR The type of the digraph the algorithm runs on. … … 275 276 /// 276 277 /// If you don't call this function before calling \ref run() or 277 /// \ref findCycleMean(), it will allocate a local \ref Path "path"278 /// structure. The destuctor deallocates this automatically278 /// \ref findCycleMean(), a local \ref Path "path" structure 279 /// will be allocated. The destuctor deallocates this automatically 279 280 /// allocated object, of course. 280 281 ///
Note: See TracChangeset
for help on using the changeset viewer.