equal
deleted
inserted
replaced
100 /// a directed cycle of minimum mean cost in a digraph |
100 /// a directed cycle of minimum mean cost in a digraph |
101 /// \cite hartmann93finding, \cite dasdan98minmeancycle. |
101 /// \cite hartmann93finding, \cite dasdan98minmeancycle. |
102 /// This method is based on \ref KarpMmc "Karp"'s original algorithm, but |
102 /// This method is based on \ref KarpMmc "Karp"'s original algorithm, but |
103 /// applies an early termination scheme. It makes the algorithm |
103 /// applies an early termination scheme. It makes the algorithm |
104 /// significantly faster for some problem instances, but slower for others. |
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 /// The algorithm runs in time O(nm) and uses space O(n<sup>2</sup>+m). |
106 /// |
106 /// |
107 /// \tparam GR The type of the digraph the algorithm runs on. |
107 /// \tparam GR The type of the digraph the algorithm runs on. |
108 /// \tparam CM The type of the cost map. The default |
108 /// \tparam CM The type of the cost map. The default |
109 /// map type is \ref concepts::Digraph::ArcMap "GR::ArcMap<int>". |
109 /// map type is \ref concepts::Digraph::ArcMap "GR::ArcMap<int>". |
110 /// \tparam TR The traits class that defines various types used by the |
110 /// \tparam TR The traits class that defines various types used by the |