Changeset 2509:a8081c9cd96a in lemon-0.x for lemon/network_simplex.h
- Timestamp:
- 11/14/07 07:28:08 (16 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3374
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/network_simplex.h
r2471 r2509 27 27 28 28 #include <limits> 29 #include <lemon/graph_adaptor.h> 30 #include <lemon/graph_utils.h> 29 31 #include <lemon/smart_graph.h> 30 #include <lemon/graph_utils.h>31 32 32 33 /// \brief The pivot rule used in the algorithm. … … 86 87 /// - Edge capacities and costs should be nonnegative integers. 87 88 /// However \c CostMap::Value should be signed type. 88 /// - Supply values should be integers.89 /// - Supply values should be signed integers. 89 90 /// - \c LowerMap::Value must be convertible to 90 91 /// \c CapacityMap::Value and \c CapacityMap::Value must be … … 149 150 public: 150 151 151 typedef typename MapBase<Edge, Cost>::Value Value;152 typedef typename MapBase<Edge, Cost>::Key Key;153 154 152 ReducedCostMap( const SGraph &_gr, 155 153 const SCostMap &_cm, … … 157 155 gr(_gr), cost_map(_cm), pot_map(_pm) {} 158 156 159 Value operator[](const Key&e) const {157 Cost operator[](const Edge &e) const { 160 158 return cost_map[e] - pot_map[gr.source(e)] + pot_map[gr.target(e)]; 161 159 }
Note: See TracChangeset
for help on using the changeset viewer.