equal
deleted
inserted
replaced
95 |
95 |
96 /// \brief Implementation of the Hartmann-Orlin algorithm for finding |
96 /// \brief Implementation of the Hartmann-Orlin algorithm for finding |
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 length (cost) in a digraph. |
100 /// a directed cycle of minimum mean length (cost) in a digraph |
|
101 /// \ref amo93networkflows, \ref dasdan98minmeancycle. |
101 /// It is an improved version of \ref Karp "Karp"'s original algorithm, |
102 /// It is an improved version of \ref Karp "Karp"'s original algorithm, |
102 /// it applies an efficient early termination scheme. |
103 /// it applies an efficient early termination scheme. |
103 /// 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). |
104 /// |
105 /// |
105 /// \tparam GR The type of the digraph the algorithm runs on. |
106 /// \tparam GR The type of the digraph the algorithm runs on. |