1.1 --- a/lemon/capacity_scaling.h	Sun Oct 05 20:08:13 2008 +0000
     1.2 +++ b/lemon/capacity_scaling.h	Mon Oct 06 15:08:17 2008 +0000
     1.3 @@ -255,9 +255,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),
     1.9 -      _res_cap(graph), _excess(graph), _pred(graph)
    1.10 +      _supply(graph), _flow(NULL), _local_flow(false),
    1.11 +      _potential(NULL), _local_potential(false),
    1.12 +      _res_cap(graph), _excess(graph), _pred(graph), _dijkstra(NULL)
    1.13      {
    1.14        // Removing non-zero lower bounds
    1.15        _capacity = subMap(capacity, lower);
    1.16 @@ -288,9 +288,9 @@
    1.17                       const CostMap &cost,
    1.18                       const SupplyMap &supply ) :
    1.19        _graph(graph), _lower(NULL), _capacity(capacity), _cost(cost),
    1.20 -      _supply(supply), _flow(0), _local_flow(false),
    1.21 -      _potential(0), _local_potential(false),
    1.22 -      _res_cap(capacity), _excess(graph), _pred(graph)
    1.23 +      _supply(supply), _flow(NULL), _local_flow(false),
    1.24 +      _potential(NULL), _local_potential(false),
    1.25 +      _res_cap(capacity), _excess(graph), _pred(graph), _dijkstra(NULL)
    1.26      {
    1.27        // Checking the sum of supply values
    1.28        Supply sum = 0;
    1.29 @@ -317,9 +317,9 @@
    1.30                       Node s, Node t,
    1.31                       Supply flow_value ) :
    1.32        _graph(graph), _lower(&lower), _capacity(graph), _cost(cost),
    1.33 -      _supply(graph), _flow(0), _local_flow(false),
    1.34 -      _potential(0), _local_potential(false),
    1.35 -      _res_cap(graph), _excess(graph), _pred(graph)
    1.36 +      _supply(graph), _flow(NULL), _local_flow(false),
    1.37 +      _potential(NULL), _local_potential(false),
    1.38 +      _res_cap(graph), _excess(graph), _pred(graph), _dijkstra(NULL)
    1.39      {
    1.40        // Removing non-zero lower bounds
    1.41        _capacity = subMap(capacity, lower);
    1.42 @@ -354,9 +354,9 @@
    1.43                       Node s, Node t,
    1.44                       Supply flow_value ) :
    1.45        _graph(graph), _lower(NULL), _capacity(capacity), _cost(cost),
    1.46 -      _supply(graph, 0), _flow(0), _local_flow(false),
    1.47 -      _potential(0), _local_potential(false),
    1.48 -      _res_cap(capacity), _excess(graph), _pred(graph)
    1.49 +      _supply(graph, 0), _flow(NULL), _local_flow(false),
    1.50 +      _potential(NULL), _local_potential(false),
    1.51 +      _res_cap(capacity), _excess(graph), _pred(graph), _dijkstra(NULL)
    1.52      {
    1.53        _supply[s] =  flow_value;
    1.54        _supply[t] = -flow_value;