lemon/hartmann_orlin_mmc.h
changeset 1070 ee9bac10f58e
parent 879 38213abd2911
child 1049 7bf489cf624e
equal deleted inserted replaced
2:0ef8d98e6706 3:62ae47ee31d2
    96   /// \brief Implementation of the Hartmann-Orlin algorithm for finding
    96   /// \brief Implementation of the Hartmann-Orlin algorithm for finding
    97   /// a minimum mean cycle.
    97   /// a minimum mean cycle.
    98   ///
    98   ///
    99   /// This class implements the Hartmann-Orlin algorithm for finding
    99   /// This class implements the Hartmann-Orlin algorithm for finding
   100   /// a directed cycle of minimum mean cost in a digraph
   100   /// a directed cycle of minimum mean cost in a digraph
   101   /// \ref amo93networkflows, \ref dasdan98minmeancycle.
   101   /// \ref hartmann93finding, \ref dasdan98minmeancycle.
   102   /// It is an improved version of \ref KarpMmc "Karp"'s original algorithm,
   102   /// It is an improved version of \ref KarpMmc "Karp"'s original algorithm,
   103   /// it applies an efficient early termination scheme.
   103   /// it applies an efficient early termination scheme.
   104   /// It runs in time O(ne) and uses space O(n<sup>2</sup>+e).
   104   /// It runs in time O(ne) and uses space O(n<sup>2</sup>+e).
   105   ///
   105   ///
   106   /// \tparam GR The type of the digraph the algorithm runs on.
   106   /// \tparam GR The type of the digraph the algorithm runs on.