lemon/cycle_canceling.h
changeset 2623 90defb96ee61
parent 2620 8f41a3129746
child 2629 84354c78b068
     1.1 --- a/lemon/cycle_canceling.h	Sun Oct 05 20:08:13 2008 +0000
     1.2 +++ b/lemon/cycle_canceling.h	Mon Oct 06 15:08:17 2008 +0000
     1.3 @@ -168,8 +168,9 @@
     1.4                      const CostMap &cost,
     1.5                      const SupplyMap &supply ) :
     1.6        _graph(graph), _lower(&lower), _capacity(graph), _cost(cost),
     1.7 -      _supply(graph), _flow(0), _local_flow(false),
     1.8 -      _potential(0), _local_potential(false), _res_cost(_cost)
     1.9 +      _supply(graph), _flow(NULL), _local_flow(false),
    1.10 +      _potential(NULL), _local_potential(false), _res_graph(NULL),
    1.11 +      _res_cost(_cost)
    1.12      {
    1.13        // Removing non-zero lower bounds
    1.14        _capacity = subMap(capacity, lower);
    1.15 @@ -198,8 +199,9 @@
    1.16                      const CostMap &cost,
    1.17                      const SupplyMap &supply ) :
    1.18        _graph(graph), _lower(NULL), _capacity(capacity), _cost(cost),
    1.19 -      _supply(supply), _flow(0), _local_flow(false),
    1.20 -      _potential(0), _local_potential(false), _res_cost(_cost)
    1.21 +      _supply(supply), _flow(NULL), _local_flow(false),
    1.22 +      _potential(NULL), _local_potential(false), _res_graph(NULL),
    1.23 +      _res_cost(_cost)
    1.24      {
    1.25        // Checking the sum of supply values
    1.26        Supply sum = 0;
    1.27 @@ -226,8 +228,9 @@
    1.28                      Node s, Node t,
    1.29                      Supply flow_value ) :
    1.30        _graph(graph), _lower(&lower), _capacity(graph), _cost(cost),
    1.31 -      _supply(graph), _flow(0), _local_flow(false),
    1.32 -      _potential(0), _local_potential(false), _res_cost(_cost)
    1.33 +      _supply(graph), _flow(NULL), _local_flow(false),
    1.34 +      _potential(NULL), _local_potential(false), _res_graph(NULL),
    1.35 +      _res_cost(_cost)
    1.36      {
    1.37        // Removing non-zero lower bounds
    1.38        _capacity = subMap(capacity, lower);
    1.39 @@ -261,8 +264,9 @@
    1.40                      Node s, Node t,
    1.41                      Supply flow_value ) :
    1.42        _graph(graph), _lower(NULL), _capacity(capacity), _cost(cost),
    1.43 -      _supply(graph, 0), _flow(0), _local_flow(false),
    1.44 -      _potential(0), _local_potential(false), _res_cost(_cost)
    1.45 +      _supply(graph, 0), _flow(NULL), _local_flow(false),
    1.46 +      _potential(NULL), _local_potential(false), _res_graph(NULL),
    1.47 +      _res_cost(_cost)
    1.48      {
    1.49        _supply[s] =  flow_value;
    1.50        _supply[t] = -flow_value;