Changes in lemon/circulation.h [956:141f9c0db4a3:735:1f08e846df29] in lemon
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/circulation.h
r956 r735 3 3 * This file is a part of LEMON, a generic C++ optimization library. 4 4 * 5 * Copyright (C) 2003-20 105 * Copyright (C) 2003-2009 6 6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport 7 7 * (Egervary Research Group on Combinatorial Optimization, EGRES). … … 60 60 /// \brief The type of supply map. 61 61 /// 62 /// The type of the map that stores the signed supply values of the 63 /// nodes. 62 /// The type of the map that stores the signed supply values of the 63 /// nodes. 64 64 /// It must conform to the \ref concepts::ReadMap "ReadMap" concept. 65 65 typedef SM SupplyMap; … … 73 73 /// It must conform to the \ref concepts::ReadWriteMap "ReadWriteMap" 74 74 /// concept. 75 #ifdef DOXYGEN76 typedef GR::ArcMap<Value> FlowMap;77 #else78 75 typedef typename Digraph::template ArcMap<Value> FlowMap; 79 #endif80 76 81 77 /// \brief Instantiates a FlowMap. … … 92 88 /// The elevator type used by the algorithm. 93 89 /// 94 /// \sa Elevator, LinkedElevator 95 #ifdef DOXYGEN 96 typedef lemon::Elevator<GR, GR::Node> Elevator; 97 #else 90 /// \sa Elevator 91 /// \sa LinkedElevator 98 92 typedef lemon::Elevator<Digraph, typename Digraph::Node> Elevator; 99 #endif100 93 101 94 /// \brief Instantiates an Elevator. … … 142 135 \geq sup(u) \quad \forall u\in V, \f] 143 136 \f[ lower(uv) \leq f(uv) \leq upper(uv) \quad \forall uv\in A. \f] 144 137 145 138 The sum of the supply values, i.e. \f$\sum_{u\in V} sup(u)\f$ must be 146 139 zero or negative in order to have a feasible solution (since the sum … … 152 145 constraints have to be satisfied with equality, i.e. all demands 153 146 have to be satisfied and all supplies have to be used. 154 147 155 148 If you need the opposite inequalities in the supply/demand constraints 156 149 (i.e. the total demand is less than the total supply and all the demands … … 174 167 \tparam SM The type of the supply map. The default map type is 175 168 \ref concepts::Digraph::NodeMap "GR::NodeMap<UM::Value>". 176 \tparam TR The traits class that defines various types used by the177 algorithm. By default, it is \ref CirculationDefaultTraits178 "CirculationDefaultTraits<GR, LM, UM, SM>".179 In most cases, this parameter should not be set directly,180 consider to use the named template parameters instead.181 169 */ 182 170 #ifdef DOXYGEN … … 312 300 /// able to automatically created by the algorithm (i.e. the 313 301 /// digraph and the maximum level should be passed to it). 314 /// However ,an external elevator object could also be passed to the302 /// However an external elevator object could also be passed to the 315 303 /// algorithm with the \ref elevator(Elevator&) "elevator()" function 316 304 /// before calling \ref run() or \ref init(). … … 338 326 /// \param graph The digraph the algorithm runs on. 339 327 /// \param lower The lower bounds for the flow values on the arcs. 340 /// \param upper The upper bounds (capacities) for the flow values 328 /// \param upper The upper bounds (capacities) for the flow values 341 329 /// on the arcs. 342 330 /// \param supply The signed supply values of the nodes. … … 463 451 } 464 452 465 /// \brief Sets the tolerance used by the algorithm. 466 /// 467 /// Sets the tolerance object used by the algorithm. 468 /// \return <tt>(*this)</tt> 453 /// \brief Sets the tolerance used by algorithm. 454 /// 455 /// Sets the tolerance used by algorithm. 469 456 Circulation& tolerance(const Tolerance& tolerance) { 470 457 _tol = tolerance; … … 474 461 /// \brief Returns a const reference to the tolerance. 475 462 /// 476 /// Returns a const reference to the tolerance object used by 477 /// the algorithm. 463 /// Returns a const reference to the tolerance. 478 464 const Tolerance& tolerance() const { 479 465 return _tol; … … 482 468 /// \name Execution Control 483 469 /// The simplest way to execute the algorithm is to call \ref run().\n 484 /// If you need bettercontrol on the initial solution or the execution,485 /// you have to call one of the \ref init() functions first, then470 /// If you need more control on the initial solution or the execution, 471 /// first you have to call one of the \ref init() functions, then 486 472 /// the \ref start() function. 487 473
Note: See TracChangeset
for help on using the changeset viewer.