Changeset 2457:8c791ee69a45 in lemon0.x for lemon/cycle_canceling.h
 Timestamp:
 06/15/07 16:36:24 (13 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@3294
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/cycle_canceling.h
r2440 r2457 23 23 /// 24 24 /// \file 25 /// \brief A cycle 25 /// \brief A cyclecanceling algorithm for finding a minimum cost flow. 26 26 27 27 #include <vector> … … 29 29 #include <lemon/graph_adaptor.h> 30 30 31 /// \brief The used cycle 31 /// \brief The used cyclecanceling method. 32 32 #define LIMITED_CYCLE_CANCELING 33 33 //#define MIN_MEAN_CYCLE_CANCELING … … 37 37 /// \brief The maximum number of iterations for the first execution 38 38 /// of the \ref lemon::BellmanFord "BellmanFord" algorithm. 39 /// It should be at least 2. 39 40 #define STARTING_LIMIT 2 40 41 /// \brief The iteration limit for the 41 42 /// \ref lemon::BellmanFord "BellmanFord" algorithm is multiplied by 42 /// <tt>ALPHA_MUL % ALPHA_DIV</tt> in every round. 43 /// <tt>ALPHA_MUL / ALPHA_DIV</tt> in every round. 44 /// <tt>ALPHA_MUL / ALPHA_DIV</tt> must be greater than 1. 43 45 #define ALPHA_MUL 3 44 46 /// \brief The iteration limit for the 45 47 /// \ref lemon::BellmanFord "BellmanFord" algorithm is multiplied by 46 /// <tt>ALPHA_MUL % ALPHA_DIV</tt> in every round. 48 /// <tt>ALPHA_MUL / ALPHA_DIV</tt> in every round. 49 /// <tt>ALPHA_MUL / ALPHA_DIV</tt> must be greater than 1. 47 50 #define ALPHA_DIV 2 48 51 49 52 //#define _ONLY_ONE_CYCLE_ 53 //#define _NO_BACK_STEP_ 50 54 //#define _DEBUG_ITER_ 51 55 #endif … … 61 65 /// @{ 62 66 63 /// \brief Implementation of a cycle 67 /// \brief Implementation of a cyclecanceling algorithm for finding 64 68 /// a minimum cost flow. 65 69 /// 66 /// \ref lemon::CycleCanceling "CycleCanceling" implements a cycle67 /// c anceling algorithm for finding a minimum cost flow.70 /// \ref lemon::CycleCanceling "CycleCanceling" implements a 71 /// cyclecanceling algorithm for finding a minimum cost flow. 68 72 /// 69 73 /// \param Graph The directed graph type the algorithm runs on. … … 119 123 protected: 120 124 121 /// \brief Map adaptor class for demand map.122 class DemandMap : public MapBase<Node, Supply>123 {124 private:125 126 const SupplyMap *map;127 128 public:129 130 typedef typename MapBase<Node, Supply>::Value Value;131 typedef typename MapBase<Node, Supply>::Key Key;132 133 DemandMap(const SupplyMap &_map) : map(&_map) {}134 135 Value operator[](const Key &e) const {136 return (*map)[e];137 }138 139 }; //class DemandMap140 141 125 /// \brief Map adaptor class for handling residual edge costs. 142 126 class ResCostMap : public MapBase<ResEdge, Cost> … … 171 155 /// \brief The modified supply map. 172 156 SupplyRefMap supply; 173 /// \brief The modified demand map.174 DemandMap demand;175 157 /// \brief The sum of supply values equals zero. 176 158 bool valid_supply; … … 200 182 const SupplyMap &_supply ) : 201 183 graph(_graph), lower(&_lower), capacity(_graph), cost(_cost), 202 supply(_graph), demand(supply),flow(_graph, 0),184 supply(_graph), flow(_graph, 0), 203 185 res_graph(_graph, capacity, flow), res_cost(cost) 204 186 { … … 230 212 const SupplyMap &_supply ) : 231 213 graph(_graph), lower(NULL), capacity(_capacity), cost(_cost), 232 supply(_supply), demand(supply),flow(_graph, 0),214 supply(_supply), flow(_graph, 0), 233 215 res_graph(_graph, capacity, flow), res_cost(cost) 234 216 { … … 260 242 Supply _flow_value ) : 261 243 graph(_graph), lower(&_lower), capacity(_graph), cost(_cost), 262 supply(_graph), demand(supply),flow(_graph, 0),244 supply(_graph), flow(_graph, 0), 263 245 res_graph(_graph, capacity, flow), res_cost(cost) 264 246 { … … 296 278 Supply _flow_value ) : 297 279 graph(_graph), lower(NULL), capacity(_capacity), cost(_cost), 298 supply(_graph, 0), demand(supply),flow(_graph, 0),280 supply(_graph, 0), flow(_graph, 0), 299 281 res_graph(_graph, capacity, flow), res_cost(cost) 300 282 { … … 346 328 // Finding a feasible flow 347 329 Circulation< Graph, Capacity, FlowMap, ConstMap<Edge, Capacity>, 348 CapacityRefMap, DemandMap >330 CapacityRefMap, SupplyMap > 349 331 circulation( graph, constMap<Edge>((Capacity)0), 350 capacity, demand, flow );332 capacity, supply, flow ); 351 333 return circulation.run() == 1; 352 334 } 353 335 354 336 #ifdef LIMITED_CYCLE_CANCELING 355 /// \brief Executes a cycle 337 /// \brief Executes a cyclecanceling algorithm using 356 338 /// \ref lemon::BellmanFord "BellmanFord" algorithm with limited 357 339 /// iteration count. … … 374 356 bool cycle_found = false; 375 357 while (!cycle_found) { 358 #ifdef _NO_BACK_STEP_ 359 int curr_iter_num = length_bound <= node_num ? 360 length_bound  iter_num : node_num  iter_num; 361 #else 376 362 int curr_iter_num = iter_num + length_bound <= node_num ? 377 363 length_bound : node_num  iter_num; 364 #endif 378 365 iter_num += curr_iter_num; 379 366 int real_iter_num = curr_iter_num; … … 433 420 434 421 #ifdef _DEBUG_ITER_ 435 std::cout << "Limited cycle 422 std::cout << "Limited cyclecanceling algorithm finished. " 436 423 << "Found " << cycle_num << " negative cycles." 437 424 << std::endl; … … 448 435 449 436 #ifdef MIN_MEAN_CYCLE_CANCELING 450 /// \brief Executes the minimum mean cycle 437 /// \brief Executes the minimum mean cyclecanceling algorithm 451 438 /// using \ref lemon::MinMeanCycle "MinMeanCycle" class. 452 439 bool start() { … … 487 474 488 475 #ifdef _DEBUG_ITER_ 489 std::cout << "Minimum mean cycle 476 std::cout << "Minimum mean cyclecanceling algorithm finished. " 490 477 << "Found " << cycle_num << " negative cycles." 491 478 << std::endl;
Note: See TracChangeset
for help on using the changeset viewer.