Changes in lemon/cost_scaling.h [1297:c0c2f5c87aa6:1298:a78e5b779b69] in lemon
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/cost_scaling.h
r1297 r1298 3 3 * This file is a part of LEMON, a generic C++ optimization library. 4 4 * 5 * Copyright (C) 2003-201 05 * Copyright (C) 2003-2013 6 6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport 7 7 * (Egervary Research Group on Combinatorial Optimization, EGRES). … … 92 92 /// \ref CostScaling implements a cost scaling algorithm that performs 93 93 /// push/augment and relabel operations for finding a \ref min_cost_flow 94 /// "minimum cost flow" \ref amo93networkflows, \ref goldberg90approximation, 95 /// \ref goldberg97efficient, \ref bunnagel98efficient. 94 /// "minimum cost flow" \cite amo93networkflows, 95 /// \cite goldberg90approximation, 96 /// \cite goldberg97efficient, \cite bunnagel98efficient. 96 97 /// It is a highly efficient primal-dual solution method, which 97 98 /// can be viewed as the generalization of the \ref Preflow 98 99 /// "preflow push-relabel" algorithm for the maximum flow problem. 100 /// It is a polynomial algorithm, its running time complexity is 101 /// \f$O(n^2m\log(nK))\f$, where <i>K</i> denotes the maximum arc cost. 99 102 /// 100 103 /// In general, \ref NetworkSimplex and \ref CostScaling are the fastest … … 151 154 typedef typename TR::LargeCost LargeCost; 152 155 153 /// The \ref CostScalingDefaultTraits "traits class" of the algorithm 156 /// \brief The \ref lemon::CostScalingDefaultTraits "traits class" 157 /// of the algorithm 154 158 typedef TR Traits; 155 159 … … 211 215 typedef std::vector<LargeCost> LargeCostVector; 212 216 typedef std::vector<char> BoolVector; 213 // Note: vector<char> is used instead of vector<bool> for efficiency reasons 217 // Note: vector<char> is used instead of vector<bool> 218 // for efficiency reasons 214 219 215 220 private: … … 667 672 /// 668 673 /// This function returns the total cost of the found flow. 669 /// Its complexity is O( e).674 /// Its complexity is O(m). 670 675 /// 671 676 /// \note The return type of the function can be specified as a … … 901 906 return OPTIMAL; 902 907 } 903 908 904 909 // Check if the upper bound is greater than or equal to the lower bound 905 910 // on each forward arc. … … 1282 1287 _buckets[r] = _bucket_next[u]; 1283 1288 1284 // Search the incom ming arcs of u1289 // Search the incoming arcs of u 1285 1290 LargeCost pi_u = _pi[u]; 1286 1291 int last_out = _first_out[u+1];
Note: See TracChangeset
for help on using the changeset viewer.