Changeset 2509:a8081c9cd96a in lemon0.x for lemon/capacity_scaling.h
 Timestamp:
 11/14/07 07:28:08 (12 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@3374
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/capacity_scaling.h
r2507 r2509 27 27 28 28 #include <vector> 29 #include <lemon/graph_adaptor.h> 29 30 #include <lemon/dijkstra.h> 30 #include <lemon/graph_adaptor.h>31 31 32 32 #define WITH_SCALING … … 44 44 45 45 /// \brief Implementation of the capacity scaling version of the 46 /// successive shortest path algorithm for finding a minimum cost flow. 46 /// successive shortest path algorithm for finding a minimum cost 47 /// flow. 47 48 /// 48 /// \ref lemon::CapacityScaling "CapacityScaling" implements a 49 /// capacity scaling algorithm for finding a minimum cost flow. 49 /// \ref lemon::CapacityScaling "CapacityScaling" implements the 50 /// capacity scaling version of the successive shortest path 51 /// algorithm for finding a minimum cost flow. 50 52 /// 51 53 /// \param Graph The directed graph type the algorithm runs on. … … 58 60 ///  Edge capacities and costs should be nonnegative integers. 59 61 /// However \c CostMap::Value should be signed type. 60 ///  Supply values should be integers.62 ///  Supply values should be signed integers. 61 63 ///  \c LowerMap::Value must be convertible to 62 64 /// \c CapacityMap::Value and \c CapacityMap::Value must be … … 114 116 public: 115 117 116 typedef typename MapBase<ResEdge, Cost>::Value Value;117 typedef typename MapBase<ResEdge, Cost>::Key Key;118 119 118 ReducedCostMap( const ResGraph &_gr, 120 119 const CostMap &_cost, … … 122 121 gr(_gr), cost_map(_cost), pot_map(_pot) {} 123 122 124 Value operator[](const Key&e) const {123 Cost operator[](const ResEdge &e) const { 125 124 return ResGraph::forward(e) ? 126 125 cost_map[e]  pot_map[gr.source(e)] + pot_map[gr.target(e)] : … … 130 129 }; //class ReducedCostMap 131 130 132 /// \brief Map adaptor for \ref lemon::Dijkstra "Dijkstra" class to133 /// update node potentials.131 /// \brief Map class for the \ref lemon::Dijkstra "Dijkstra" 132 /// algorithm to update node potentials. 134 133 class PotentialUpdateMap : public MapBase<ResNode, Cost> 135 134 { … … 142 141 public: 143 142 144 typedef typename MapBase<ResNode, Cost>::Value Value;145 typedef typename MapBase<ResNode, Cost>::Key Key;146 147 143 void potentialMap(PotentialMap &_pot) { 148 144 pot = &_pot; … … 153 149 } 154 150 155 void set(const Key &n, const Value&v) {151 void set(const ResNode &n, const Cost &v) { 156 152 data.push_back(Pair(n, v)); 157 153 } … … 186 182 187 183 /// \brief Map adaptor class for filtering edges with at least 188 /// \c delta residual capacity 184 /// \c delta residual capacity. 189 185 class DeltaFilterMap : public MapBase<ResEdge, bool> 190 186 { … … 196 192 public: 197 193 198 typedef typename MapBase<ResEdge, Cost>::Value Value;199 typedef typename MapBase<ResEdge, Cost>::Key Key;200 201 194 DeltaFilterMap(const ResGraph &_gr, const Capacity &_delta) : 202 195 gr(_gr), delta(_delta) {} 203 196 204 Value operator[](const Key&e) const {197 bool operator[](const ResEdge &e) const { 205 198 return gr.rescap(e) >= delta; 206 199 } … … 299 292 /// \brief The delta parameter used for capacity scaling. 300 293 Capacity delta; 301 /// \brief Edge filter map. 294 /// \brief Edge filter map for filtering edges with at least 295 /// \c delta residual capacity. 302 296 DeltaFilterMap delta_filter; 303 /// \brief The delta residual graph. 297 /// \brief The delta residual graph (i.e. the subgraph of the 298 /// residual graph consisting of edges with at least \c delta 299 /// residual capacity). 304 300 DeltaResGraph dres_graph; 305 301 /// \brief Map for identifing deficit nodes. … … 574 570 if (red_cost[e] < 0) { 575 571 res_graph.augment(e, r = res_graph.rescap(e)); 572 imbalance[dres_graph.source(e)] = r; 576 573 imbalance[dres_graph.target(e)] += r; 577 imbalance[dres_graph.source(e)] = r;578 574 } 579 575 }
Note: See TracChangeset
for help on using the changeset viewer.