equal
deleted
inserted
replaced
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 /// \cite karp78characterization, \cite dasdan98minmeancycle. |
101 /// \cite karp78characterization, \cite dasdan98minmeancycle. |
102 /// It runs in time O(ne) and uses space O(n<sup>2</sup>+e). |
102 /// It runs in time O(nm) and uses space O(n<sup>2</sup>+m). |
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>". |
107 /// \tparam TR The traits class that defines various types used by the |
107 /// \tparam TR The traits class that defines various types used by the |