Changeset 818:8452ca46e29a in lemon for lemon/hartmann_orlin.h
- Timestamp:
- 10/15/09 12:55:41 (15 years ago)
- Branch:
- default
- Phase:
- public
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/hartmann_orlin.h
r816 r818 98 98 /// 99 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 102 /// It is an improved version of \ref Karp "Karp"'s original algorithm, 102 103 /// it applies an efficient early termination scheme.
Note: See TracChangeset
for help on using the changeset viewer.