equal
deleted
inserted
replaced
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 cost in a digraph |
100 /// a directed cycle of minimum mean cost in a digraph |
101 /// \ref hartmann93finding, \ref 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(ne) and uses space O(n<sup>2</sup>+e). |
106 /// |
106 /// |