equal
  deleted
  inserted
  replaced
  
    
    
    36   /// \brief Default traits class of HartmannOrlinMmc class.  | 
    36   /// \brief Default traits class of HartmannOrlinMmc class.  | 
    37   ///  | 
    37   ///  | 
    38   /// Default traits class of HartmannOrlinMmc class.  | 
    38   /// Default traits class of HartmannOrlinMmc class.  | 
    39   /// \tparam GR The type of the digraph.  | 
    39   /// \tparam GR The type of the digraph.  | 
    40   /// \tparam CM The type of the cost map.  | 
    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 #ifdef DOXYGEN  | 
    42 #ifdef DOXYGEN  | 
    43   template <typename GR, typename CM>  | 
    43   template <typename GR, typename CM>  | 
    44 #else  | 
    44 #else  | 
    45   template <typename GR, typename CM,  | 
    45   template <typename GR, typename CM,  | 
    46     bool integer = std::numeric_limits<typename CM::Value>::is_integer>  | 
    46     bool integer = std::numeric_limits<typename CM::Value>::is_integer>  | 
    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 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   /// 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.  | 
   107   /// \tparam CM The type of the cost map. The default  | 
   107   /// \tparam CM The type of the cost map. The default  |