lemon/karp_mmc.h
changeset 1011 9a6c9d4ee77b
parent 877 141f9c0db4a3
child 1049 7bf489cf624e
equal deleted inserted replaced
1:265ef7dda9de 2:80bfcaf33913
    96   /// \brief Implementation of Karp's algorithm for finding a minimum
    96   /// \brief Implementation of Karp's algorithm for finding a minimum
    97   /// mean cycle.
    97   /// mean cycle.
    98   ///
    98   ///
    99   /// This class implements Karp's algorithm for finding a directed
    99   /// This class implements Karp's algorithm for finding a directed
   100   /// cycle of minimum mean cost in a digraph
   100   /// cycle of minimum mean cost in a digraph
   101   /// \ref amo93networkflows, \ref dasdan98minmeancycle.
   101   /// \ref karp78characterization, \ref dasdan98minmeancycle.
   102   /// It runs in time O(ne) and uses space O(n<sup>2</sup>+e).
   102   /// It runs in time O(ne) and uses space O(n<sup>2</sup>+e).
   103   ///
   103   ///
   104   /// \tparam GR The type of the digraph the algorithm runs on.
   104   /// \tparam GR The type of the digraph the algorithm runs on.
   105   /// \tparam CM The type of the cost map. The default
   105   /// \tparam CM The type of the cost map. The default
   106   /// map type is \ref concepts::Digraph::ArcMap "GR::ArcMap<int>".
   106   /// map type is \ref concepts::Digraph::ArcMap "GR::ArcMap<int>".