equal
deleted
inserted
replaced
96 /// \brief Implementation of Howard's algorithm for finding a minimum |
96 /// \brief Implementation of Howard's algorithm for finding a minimum |
97 /// mean cycle. |
97 /// mean cycle. |
98 /// |
98 /// |
99 /// This class implements Howard's policy iteration algorithm for finding |
99 /// This class implements Howard's policy iteration 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 amo93networkflows, \ref dasdan98minmeancycle. |
101 /// \ref dasdan98minmeancycle, \ref dasdan04experimental. |
102 /// This class provides the most efficient algorithm for the |
102 /// This class provides the most efficient algorithm for the |
103 /// minimum mean cycle problem, though the best known theoretical |
103 /// minimum mean cycle problem, though the best known theoretical |
104 /// bound on its running time is exponential. |
104 /// bound on its running time is exponential. |
105 /// |
105 /// |
106 /// \tparam GR The type of the digraph the algorithm runs on. |
106 /// \tparam GR The type of the digraph the algorithm runs on. |