Changes in lemon/howard_mmc.h [1221:1c978b5bcc65:1178:21a9f829ab68] in lemon
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/howard_mmc.h
r1221 r1178 99 99 /// This class implements Howard's policy iteration algorithm for finding 100 100 /// a directed cycle of minimum mean cost in a digraph 101 /// \ cite dasdan98minmeancycle, \citedasdan04experimental.101 /// \ref dasdan98minmeancycle, \ref dasdan04experimental. 102 102 /// This class provides the most efficient algorithm for the 103 103 /// minimum mean cycle problem, though the best known theoretical … … 283 283 /// 284 284 /// If you don't call this function before calling \ref run() or 285 /// \ref findCycleMean(), a local \ref Path "path" structure286 /// will be allocated. The destuctor deallocates this automatically285 /// \ref findCycleMean(), it will allocate a local \ref Path "path" 286 /// structure. The destuctor deallocates this automatically 287 287 /// allocated object, of course. 288 288 ///
Note: See TracChangeset
for help on using the changeset viewer.