Changeset 833:e20173729589 in lemon for lemon/network_simplex.h
 Timestamp:
 11/13/09 18:10:06 (10 years ago)
 Branch:
 default
 Phase:
 public
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/network_simplex.h
r777 r833 49 49 /// in LEMON for the minimum cost flow problem. 50 50 /// Moreover it supports both directions of the supply/demand inequality 51 /// constraints. For more information see \ref SupplyType.51 /// constraints. For more information, see \ref SupplyType. 52 52 /// 53 53 /// Most of the parameters of the problem (except for the digraph) … … 58 58 /// \tparam GR The digraph type the algorithm runs on. 59 59 /// \tparam V The value type used for flow amounts, capacity bounds 60 /// and supply values in the algorithm. By default it is \c int.60 /// and supply values in the algorithm. By default, it is \c int. 61 61 /// \tparam C The value type used for costs and potentials in the 62 /// algorithm. By default it is the same as \c V.62 /// algorithm. By default, it is the same as \c V. 63 63 /// 64 64 /// \warning Both value types must be signed and all input data must … … 67 67 /// \note %NetworkSimplex provides five different pivot rule 68 68 /// implementations, from which the most efficient one is used 69 /// by default. For more information see \ref PivotRule.69 /// by default. For more information, see \ref PivotRule. 70 70 template <typename GR, typename V = int, typename C = V> 71 71 class NetworkSimplex … … 123 123 /// implementations that significantly affect the running time 124 124 /// of the algorithm. 125 /// By default \ref BLOCK_SEARCH "Block Search" is used, which125 /// By default, \ref BLOCK_SEARCH "Block Search" is used, which 126 126 /// proved to be the most efficient and the most robust on various 127 127 /// test inputs according to our benchmark tests. 128 /// However another pivot rule can be selected using the \ref run()128 /// However, another pivot rule can be selected using the \ref run() 129 129 /// function with the proper parameter. 130 130 enum PivotRule { 131 131 132 /// The FirstEligible pivot rule.132 /// The \e First \e Eligible pivot rule. 133 133 /// The next eligible arc is selected in a wraparound fashion 134 134 /// in every iteration. 135 135 FIRST_ELIGIBLE, 136 136 137 /// The BestEligible pivot rule.137 /// The \e Best \e Eligible pivot rule. 138 138 /// The best eligible arc is selected in every iteration. 139 139 BEST_ELIGIBLE, 140 140 141 /// The BlockSearch pivot rule.141 /// The \e Block \e Search pivot rule. 142 142 /// A specified number of arcs are examined in every iteration 143 143 /// in a wraparound fashion and the best eligible arc is selected … … 145 145 BLOCK_SEARCH, 146 146 147 /// The Candidate List pivot rule.147 /// The \e Candidate \e List pivot rule. 148 148 /// In a major iteration a candidate list is built from eligible arcs 149 149 /// in a wraparound fashion and in the following minor iterations … … 151 151 CANDIDATE_LIST, 152 152 153 /// The Altering Candidate List pivot rule.153 /// The \e Altering \e Candidate \e List pivot rule. 154 154 /// It is a modified version of the Candidate List method. 155 155 /// It keeps only the several best eligible arcs from the former … … 811 811 /// type will be used. 812 812 /// 813 /// For more information see \ref SupplyType.813 /// For more information, see \ref SupplyType. 814 814 /// 815 815 /// \return <tt>(*this)</tt> … … 843 843 /// \ref reset() is called, thus only the modified parameters 844 844 /// have to be set again. See \ref reset() for examples. 845 /// However the underlying digraph must not be modified after this845 /// However, the underlying digraph must not be modified after this 846 846 /// class have been constructed, since it copies and extends the graph. 847 847 /// 848 848 /// \param pivot_rule The pivot rule that will be used during the 849 /// algorithm. For more information see \ref PivotRule.849 /// algorithm. For more information, see \ref PivotRule. 850 850 /// 851 851 /// \return \c INFEASIBLE if no feasible flow exists, … … 872 872 /// used, all the parameters given before are kept for the next 873 873 /// \ref run() call. 874 /// However the underlying digraph must not be modified after this874 /// However, the underlying digraph must not be modified after this 875 875 /// class have been constructed, since it copies and extends the graph. 876 876 ///
Note: See TracChangeset
for help on using the changeset viewer.