Changeset 768:0a42883c8221 in lemon-1.2 for lemon
- Timestamp:
- 08/12/09 09:45:15 (15 years ago)
- Branch:
- default
- Phase:
- public
- Location:
- lemon
- Files:
-
- 3 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/hartmann_orlin.h
r767 r768 20 20 #define LEMON_HARTMANN_ORLIN_H 21 21 22 /// \ingroup shortest_path22 /// \ingroup min_mean_cycle 23 23 /// 24 24 /// \file … … 91 91 92 92 93 /// \addtogroup shortest_path93 /// \addtogroup min_mean_cycle 94 94 /// @{ 95 95 … … 99 99 /// This class implements the Hartmann-Orlin algorithm for finding 100 100 /// a directed cycle of minimum mean length (cost) in a digraph. 101 /// It is an improved version of \ref Karp "Karp 's original algorithm",101 /// It is an improved version of \ref Karp "Karp"'s original algorithm, 102 102 /// it applies an efficient early termination scheme. 103 /// It runs in time O(ne) and uses space O(n<sup>2</sup>+e). 103 104 /// 104 105 /// \tparam GR The type of the digraph the algorithm runs on. -
lemon/howard.h
r767 r768 20 20 #define LEMON_HOWARD_H 21 21 22 /// \ingroup shortest_path22 /// \ingroup min_mean_cycle 23 23 /// 24 24 /// \file … … 91 91 92 92 93 /// \addtogroup shortest_path93 /// \addtogroup min_mean_cycle 94 94 /// @{ 95 95 … … 99 99 /// This class implements Howard's policy iteration algorithm for finding 100 100 /// a directed cycle of minimum mean length (cost) in a digraph. 101 /// This class provides the most efficient algorithm for the 102 /// minimum mean cycle problem, though the best known theoretical 103 /// bound on its running time is exponential. 101 104 /// 102 105 /// \tparam GR The type of the digraph the algorithm runs on. -
lemon/karp.h
r767 r768 20 20 #define LEMON_KARP_H 21 21 22 /// \ingroup shortest_path22 /// \ingroup min_mean_cycle 23 23 /// 24 24 /// \file … … 91 91 92 92 93 /// \addtogroup shortest_path93 /// \addtogroup min_mean_cycle 94 94 /// @{ 95 95 … … 99 99 /// This class implements Karp's algorithm for finding a directed 100 100 /// cycle of minimum mean length (cost) in a digraph. 101 /// It runs in time O(ne) and uses space O(n<sup>2</sup>+e). 101 102 /// 102 103 /// \tparam GR The type of the digraph the algorithm runs on.
Note: See TracChangeset
for help on using the changeset viewer.
