equal
deleted
inserted
replaced
95 |
95 |
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 length (cost) in a digraph. |
100 /// cycle of minimum mean length (cost) in a digraph |
|
101 /// \ref amo93networkflows, \ref dasdan98minmeancycle. |
101 /// 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). |
102 /// |
103 /// |
103 /// \tparam GR The type of the digraph the algorithm runs on. |
104 /// \tparam GR The type of the digraph the algorithm runs on. |
104 /// \tparam LEN The type of the length map. The default |
105 /// \tparam LEN The type of the length map. The default |
105 /// map type is \ref concepts::Digraph::ArcMap "GR::ArcMap<int>". |
106 /// map type is \ref concepts::Digraph::ArcMap "GR::ArcMap<int>". |