Changeset 771:8452ca46e29a in lemon1.2 for lemon
 Timestamp:
 10/15/09 12:55:41 (10 years ago)
 Branch:
 default
 Phase:
 public
 Location:
 lemon
 Files:

 3 edited
Legend:
 Unmodified
 Added
 Removed

lemon/hartmann_orlin.h
r769 r771 98 98 /// 99 99 /// This class implements the HartmannOrlin 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. 
lemon/howard.h
r769 r771 98 98 /// 99 99 /// This class implements Howard's policy iteration 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 /// This class provides the most efficient algorithm for the 102 103 /// minimum mean cycle problem, though the best known theoretical 
lemon/karp.h
r769 r771 98 98 /// 99 99 /// This class implements Karp's algorithm for finding a directed 100 /// cycle of minimum mean length (cost) in a digraph. 100 /// cycle of minimum mean length (cost) in a digraph 101 /// \ref amo93networkflows, \ref dasdan98minmeancycle. 101 102 /// It runs in time O(ne) and uses space O(n<sup>2</sup>+e). 102 103 ///
Note: See TracChangeset
for help on using the changeset viewer.