Changeset 2623:90defb96ee61 in lemon0.x
 Timestamp:
 10/06/08 17:08:17 (11 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@3508
 Location:
 lemon
 Files:

 4 edited
Legend:
 Unmodified
 Added
 Removed

lemon/capacity_scaling.h
r2620 r2623 256 256 const SupplyMap &supply ) : 257 257 _graph(graph), _lower(&lower), _capacity(graph), _cost(cost), 258 _supply(graph), _flow( 0), _local_flow(false),259 _potential( 0), _local_potential(false),260 _res_cap(graph), _excess(graph), _pred(graph) 258 _supply(graph), _flow(NULL), _local_flow(false), 259 _potential(NULL), _local_potential(false), 260 _res_cap(graph), _excess(graph), _pred(graph), _dijkstra(NULL) 261 261 { 262 262 // Removing nonzero lower bounds … … 289 289 const SupplyMap &supply ) : 290 290 _graph(graph), _lower(NULL), _capacity(capacity), _cost(cost), 291 _supply(supply), _flow( 0), _local_flow(false),292 _potential( 0), _local_potential(false),293 _res_cap(capacity), _excess(graph), _pred(graph) 291 _supply(supply), _flow(NULL), _local_flow(false), 292 _potential(NULL), _local_potential(false), 293 _res_cap(capacity), _excess(graph), _pred(graph), _dijkstra(NULL) 294 294 { 295 295 // Checking the sum of supply values … … 318 318 Supply flow_value ) : 319 319 _graph(graph), _lower(&lower), _capacity(graph), _cost(cost), 320 _supply(graph), _flow( 0), _local_flow(false),321 _potential( 0), _local_potential(false),322 _res_cap(graph), _excess(graph), _pred(graph) 320 _supply(graph), _flow(NULL), _local_flow(false), 321 _potential(NULL), _local_potential(false), 322 _res_cap(graph), _excess(graph), _pred(graph), _dijkstra(NULL) 323 323 { 324 324 // Removing nonzero lower bounds … … 355 355 Supply flow_value ) : 356 356 _graph(graph), _lower(NULL), _capacity(capacity), _cost(cost), 357 _supply(graph, 0), _flow( 0), _local_flow(false),358 _potential( 0), _local_potential(false),359 _res_cap(capacity), _excess(graph), _pred(graph) 357 _supply(graph, 0), _flow(NULL), _local_flow(false), 358 _potential(NULL), _local_potential(false), 359 _res_cap(capacity), _excess(graph), _pred(graph), _dijkstra(NULL) 360 360 { 361 361 _supply[s] = flow_value; 
lemon/cost_scaling.h
r2620 r2623 182 182 bool _local_potential; 183 183 184 // The residual cost map 185 ResidualCostMap<LargeCostMap> _res_cost; 184 186 // The residual graph 185 187 ResGraph *_res_graph; 186 // The residual cost map187 ResidualCostMap<LargeCostMap> _res_cost;188 188 // The reduced cost map 189 189 ReducedCostMap *_red_cost; … … 210 210 const SupplyMap &supply ) : 211 211 _graph(graph), _lower(&lower), _capacity(graph), _orig_cost(cost), 212 _cost(graph), _supply(graph), _flow( 0), _local_flow(false),213 _potential( 0), _local_potential(false), _res_cost(_cost),214 _ excess(graph, 0)212 _cost(graph), _supply(graph), _flow(NULL), _local_flow(false), 213 _potential(NULL), _local_potential(false), _res_cost(_cost), 214 _res_graph(NULL), _red_cost(NULL), _excess(graph, 0) 215 215 { 216 216 // Removing nonzero lower bounds … … 242 242 const SupplyMap &supply ) : 243 243 _graph(graph), _lower(NULL), _capacity(capacity), _orig_cost(cost), 244 _cost(graph), _supply(supply), _flow( 0), _local_flow(false),245 _potential( 0), _local_potential(false), _res_cost(_cost),246 _ excess(graph, 0)244 _cost(graph), _supply(supply), _flow(NULL), _local_flow(false), 245 _potential(NULL), _local_potential(false), _res_cost(_cost), 246 _res_graph(NULL), _red_cost(NULL), _excess(graph, 0) 247 247 { 248 248 // Checking the sum of supply values … … 271 271 Supply flow_value ) : 272 272 _graph(graph), _lower(&lower), _capacity(graph), _orig_cost(cost), 273 _cost(graph), _supply(graph), _flow( 0), _local_flow(false),274 _potential( 0), _local_potential(false), _res_cost(_cost),275 _ excess(graph, 0)273 _cost(graph), _supply(graph), _flow(NULL), _local_flow(false), 274 _potential(NULL), _local_potential(false), _res_cost(_cost), 275 _res_graph(NULL), _red_cost(NULL), _excess(graph, 0) 276 276 { 277 277 // Removing nonzero lower bounds … … 307 307 Supply flow_value ) : 308 308 _graph(graph), _lower(NULL), _capacity(capacity), _orig_cost(cost), 309 _cost(graph), _supply(graph, 0), _flow( 0), _local_flow(false),310 _potential( 0), _local_potential(false), _res_cost(_cost),311 _ excess(graph, 0)309 _cost(graph), _supply(graph, 0), _flow(NULL), _local_flow(false), 310 _potential(NULL), _local_potential(false), _res_cost(_cost), 311 _res_graph(NULL), _red_cost(NULL), _excess(graph, 0) 312 312 { 313 313 _supply[s] = flow_value; 
lemon/cycle_canceling.h
r2620 r2623 169 169 const SupplyMap &supply ) : 170 170 _graph(graph), _lower(&lower), _capacity(graph), _cost(cost), 171 _supply(graph), _flow(0), _local_flow(false), 172 _potential(0), _local_potential(false), _res_cost(_cost) 171 _supply(graph), _flow(NULL), _local_flow(false), 172 _potential(NULL), _local_potential(false), _res_graph(NULL), 173 _res_cost(_cost) 173 174 { 174 175 // Removing nonzero lower bounds … … 199 200 const SupplyMap &supply ) : 200 201 _graph(graph), _lower(NULL), _capacity(capacity), _cost(cost), 201 _supply(supply), _flow(0), _local_flow(false), 202 _potential(0), _local_potential(false), _res_cost(_cost) 202 _supply(supply), _flow(NULL), _local_flow(false), 203 _potential(NULL), _local_potential(false), _res_graph(NULL), 204 _res_cost(_cost) 203 205 { 204 206 // Checking the sum of supply values … … 227 229 Supply flow_value ) : 228 230 _graph(graph), _lower(&lower), _capacity(graph), _cost(cost), 229 _supply(graph), _flow(0), _local_flow(false), 230 _potential(0), _local_potential(false), _res_cost(_cost) 231 _supply(graph), _flow(NULL), _local_flow(false), 232 _potential(NULL), _local_potential(false), _res_graph(NULL), 233 _res_cost(_cost) 231 234 { 232 235 // Removing nonzero lower bounds … … 262 265 Supply flow_value ) : 263 266 _graph(graph), _lower(NULL), _capacity(capacity), _cost(cost), 264 _supply(graph, 0), _flow(0), _local_flow(false), 265 _potential(0), _local_potential(false), _res_cost(_cost) 267 _supply(graph, 0), _flow(NULL), _local_flow(false), 268 _potential(NULL), _local_potential(false), _res_graph(NULL), 269 _res_cost(_cost) 266 270 { 267 271 _supply[s] = flow_value; 
lemon/network_simplex.h
r2619 r2623 32 32 #include <lemon/smart_graph.h> 33 33 #include <lemon/math.h> 34 35 #define _DEBUG_36 34 37 35 namespace lemon { … … 610 608 _pred_edge(_graph), _thread(_graph), _forward(_graph), 611 609 _state(_graph), _red_cost(_graph, _cost, _potential), 612 _flow_result( 0), _potential_result(0),610 _flow_result(NULL), _potential_result(NULL), 613 611 _local_flow(false), _local_potential(false), 614 612 _node_ref(graph), _edge_ref(graph) … … 660 658 _pred_edge(_graph), _thread(_graph), _forward(_graph), 661 659 _state(_graph), _red_cost(_graph, _cost, _potential), 662 _flow_result( 0), _potential_result(0),660 _flow_result(NULL), _potential_result(NULL), 663 661 _local_flow(false), _local_potential(false), 664 662 _node_ref(graph), _edge_ref(graph) … … 704 702 _pred_edge(_graph), _thread(_graph), _forward(_graph), 705 703 _state(_graph), _red_cost(_graph, _cost, _potential), 706 _flow_result( 0), _potential_result(0),704 _flow_result(NULL), _potential_result(NULL), 707 705 _local_flow(false), _local_potential(false), 708 706 _node_ref(graph), _edge_ref(graph) … … 754 752 _pred_edge(_graph), _thread(_graph), _forward(_graph), 755 753 _state(_graph), _red_cost(_graph, _cost, _potential), 756 _flow_result( 0), _potential_result(0),754 _flow_result(NULL), _potential_result(NULL), 757 755 _local_flow(false), _local_potential(false), 758 756 _node_ref(graph), _edge_ref(graph)
Note: See TracChangeset
for help on using the changeset viewer.