lemon/capacity_scaling.h
author Peter Kovacs <kpeter@inf.elte.hu>
Sat, 13 Mar 2010 22:01:38 +0100
changeset 864 d3ea191c3412
parent 840 2914b6f0fde0
child 877 141f9c0db4a3
permissions -rw-r--r--
Rename min mean cycle classes and their members (#179)
with respect to the possible introduction of min ratio
cycle algorithms in the future.

The renamed classes:
- Karp --> KarpMmc
- HartmannOrlin --> HartmannOrlinMmc
- Howard --> HowardMmc

The renamed members:
- cycleLength() --> cycleCost()
- cycleArcNum() --> cycleSize()
- findMinMean() --> findCycleMean()
- Value --> Cost
- LargeValue --> LargeCost
- SetLargeValue --> SetLargeCost
kpeter@805
     1
/* -*- C++ -*-
kpeter@805
     2
 *
kpeter@805
     3
 * This file is a part of LEMON, a generic C++ optimization library
kpeter@805
     4
 *
kpeter@805
     5
 * Copyright (C) 2003-2008
kpeter@805
     6
 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
kpeter@805
     7
 * (Egervary Research Group on Combinatorial Optimization, EGRES).
kpeter@805
     8
 *
kpeter@805
     9
 * Permission to use, modify and distribute this software is granted
kpeter@805
    10
 * provided that this copyright notice appears in all copies. For
kpeter@805
    11
 * precise terms see the accompanying LICENSE file.
kpeter@805
    12
 *
kpeter@805
    13
 * This software is provided "AS IS" with no warranty of any kind,
kpeter@805
    14
 * express or implied, and with no claim as to its suitability for any
kpeter@805
    15
 * purpose.
kpeter@805
    16
 *
kpeter@805
    17
 */
kpeter@805
    18
kpeter@805
    19
#ifndef LEMON_CAPACITY_SCALING_H
kpeter@805
    20
#define LEMON_CAPACITY_SCALING_H
kpeter@805
    21
kpeter@806
    22
/// \ingroup min_cost_flow_algs
kpeter@805
    23
///
kpeter@805
    24
/// \file
kpeter@806
    25
/// \brief Capacity Scaling algorithm for finding a minimum cost flow.
kpeter@805
    26
kpeter@805
    27
#include <vector>
kpeter@806
    28
#include <limits>
kpeter@806
    29
#include <lemon/core.h>
kpeter@805
    30
#include <lemon/bin_heap.h>
kpeter@805
    31
kpeter@805
    32
namespace lemon {
kpeter@805
    33
kpeter@807
    34
  /// \brief Default traits class of CapacityScaling algorithm.
kpeter@807
    35
  ///
kpeter@807
    36
  /// Default traits class of CapacityScaling algorithm.
kpeter@807
    37
  /// \tparam GR Digraph type.
kpeter@812
    38
  /// \tparam V The number type used for flow amounts, capacity bounds
kpeter@807
    39
  /// and supply values. By default it is \c int.
kpeter@812
    40
  /// \tparam C The number type used for costs and potentials.
kpeter@807
    41
  /// By default it is the same as \c V.
kpeter@807
    42
  template <typename GR, typename V = int, typename C = V>
kpeter@807
    43
  struct CapacityScalingDefaultTraits
kpeter@807
    44
  {
kpeter@807
    45
    /// The type of the digraph
kpeter@807
    46
    typedef GR Digraph;
kpeter@807
    47
    /// The type of the flow amounts, capacity bounds and supply values
kpeter@807
    48
    typedef V Value;
kpeter@807
    49
    /// The type of the arc costs
kpeter@807
    50
    typedef C Cost;
kpeter@807
    51
kpeter@807
    52
    /// \brief The type of the heap used for internal Dijkstra computations.
kpeter@807
    53
    ///
kpeter@807
    54
    /// The type of the heap used for internal Dijkstra computations.
kpeter@807
    55
    /// It must conform to the \ref lemon::concepts::Heap "Heap" concept,
kpeter@807
    56
    /// its priority type must be \c Cost and its cross reference type
kpeter@807
    57
    /// must be \ref RangeMap "RangeMap<int>".
kpeter@807
    58
    typedef BinHeap<Cost, RangeMap<int> > Heap;
kpeter@807
    59
  };
kpeter@807
    60
kpeter@806
    61
  /// \addtogroup min_cost_flow_algs
kpeter@805
    62
  /// @{
kpeter@805
    63
kpeter@806
    64
  /// \brief Implementation of the Capacity Scaling algorithm for
kpeter@806
    65
  /// finding a \ref min_cost_flow "minimum cost flow".
kpeter@805
    66
  ///
kpeter@805
    67
  /// \ref CapacityScaling implements the capacity scaling version
kpeter@806
    68
  /// of the successive shortest path algorithm for finding a
kpeter@813
    69
  /// \ref min_cost_flow "minimum cost flow" \ref amo93networkflows,
kpeter@813
    70
  /// \ref edmondskarp72theoretical. It is an efficient dual
kpeter@806
    71
  /// solution method.
kpeter@805
    72
  ///
kpeter@806
    73
  /// Most of the parameters of the problem (except for the digraph)
kpeter@806
    74
  /// can be given using separate functions, and the algorithm can be
kpeter@806
    75
  /// executed using the \ref run() function. If some parameters are not
kpeter@806
    76
  /// specified, then default values will be used.
kpeter@805
    77
  ///
kpeter@806
    78
  /// \tparam GR The digraph type the algorithm runs on.
kpeter@812
    79
  /// \tparam V The number type used for flow amounts, capacity bounds
kpeter@825
    80
  /// and supply values in the algorithm. By default, it is \c int.
kpeter@812
    81
  /// \tparam C The number type used for costs and potentials in the
kpeter@825
    82
  /// algorithm. By default, it is the same as \c V.
kpeter@825
    83
  /// \tparam TR The traits class that defines various types used by the
kpeter@825
    84
  /// algorithm. By default, it is \ref CapacityScalingDefaultTraits
kpeter@825
    85
  /// "CapacityScalingDefaultTraits<GR, V, C>".
kpeter@825
    86
  /// In most cases, this parameter should not be set directly,
kpeter@825
    87
  /// consider to use the named template parameters instead.
kpeter@805
    88
  ///
kpeter@812
    89
  /// \warning Both number types must be signed and all input data must
kpeter@806
    90
  /// be integer.
kpeter@806
    91
  /// \warning This algorithm does not support negative costs for such
kpeter@806
    92
  /// arcs that have infinite upper bound.
kpeter@807
    93
#ifdef DOXYGEN
kpeter@807
    94
  template <typename GR, typename V, typename C, typename TR>
kpeter@807
    95
#else
kpeter@807
    96
  template < typename GR, typename V = int, typename C = V,
kpeter@807
    97
             typename TR = CapacityScalingDefaultTraits<GR, V, C> >
kpeter@807
    98
#endif
kpeter@805
    99
  class CapacityScaling
kpeter@805
   100
  {
kpeter@806
   101
  public:
kpeter@805
   102
kpeter@807
   103
    /// The type of the digraph
kpeter@807
   104
    typedef typename TR::Digraph Digraph;
kpeter@806
   105
    /// The type of the flow amounts, capacity bounds and supply values
kpeter@807
   106
    typedef typename TR::Value Value;
kpeter@806
   107
    /// The type of the arc costs
kpeter@807
   108
    typedef typename TR::Cost Cost;
kpeter@807
   109
kpeter@807
   110
    /// The type of the heap used for internal Dijkstra computations
kpeter@807
   111
    typedef typename TR::Heap Heap;
kpeter@807
   112
kpeter@807
   113
    /// The \ref CapacityScalingDefaultTraits "traits class" of the algorithm
kpeter@807
   114
    typedef TR Traits;
kpeter@805
   115
kpeter@805
   116
  public:
kpeter@805
   117
kpeter@806
   118
    /// \brief Problem type constants for the \c run() function.
kpeter@806
   119
    ///
kpeter@806
   120
    /// Enum type containing the problem type constants that can be
kpeter@806
   121
    /// returned by the \ref run() function of the algorithm.
kpeter@806
   122
    enum ProblemType {
kpeter@806
   123
      /// The problem has no feasible solution (flow).
kpeter@806
   124
      INFEASIBLE,
kpeter@806
   125
      /// The problem has optimal solution (i.e. it is feasible and
kpeter@806
   126
      /// bounded), and the algorithm has found optimal flow and node
kpeter@806
   127
      /// potentials (primal and dual solutions).
kpeter@806
   128
      OPTIMAL,
kpeter@806
   129
      /// The digraph contains an arc of negative cost and infinite
kpeter@806
   130
      /// upper bound. It means that the objective function is unbounded
kpeter@812
   131
      /// on that arc, however, note that it could actually be bounded
kpeter@806
   132
      /// over the feasible flows, but this algroithm cannot handle
kpeter@806
   133
      /// these cases.
kpeter@806
   134
      UNBOUNDED
kpeter@806
   135
    };
kpeter@806
   136
  
kpeter@806
   137
  private:
kpeter@806
   138
kpeter@806
   139
    TEMPLATE_DIGRAPH_TYPEDEFS(GR);
kpeter@806
   140
kpeter@806
   141
    typedef std::vector<int> IntVector;
kpeter@806
   142
    typedef std::vector<Value> ValueVector;
kpeter@806
   143
    typedef std::vector<Cost> CostVector;
kpeter@839
   144
    typedef std::vector<char> BoolVector;
kpeter@839
   145
    // Note: vector<char> is used instead of vector<bool> for efficiency reasons
kpeter@805
   146
kpeter@805
   147
  private:
kpeter@805
   148
kpeter@806
   149
    // Data related to the underlying digraph
kpeter@806
   150
    const GR &_graph;
kpeter@806
   151
    int _node_num;
kpeter@806
   152
    int _arc_num;
kpeter@806
   153
    int _res_arc_num;
kpeter@806
   154
    int _root;
kpeter@806
   155
kpeter@806
   156
    // Parameters of the problem
kpeter@806
   157
    bool _have_lower;
kpeter@806
   158
    Value _sum_supply;
kpeter@806
   159
kpeter@806
   160
    // Data structures for storing the digraph
kpeter@806
   161
    IntNodeMap _node_id;
kpeter@806
   162
    IntArcMap _arc_idf;
kpeter@806
   163
    IntArcMap _arc_idb;
kpeter@806
   164
    IntVector _first_out;
kpeter@806
   165
    BoolVector _forward;
kpeter@806
   166
    IntVector _source;
kpeter@806
   167
    IntVector _target;
kpeter@806
   168
    IntVector _reverse;
kpeter@806
   169
kpeter@806
   170
    // Node and arc data
kpeter@806
   171
    ValueVector _lower;
kpeter@806
   172
    ValueVector _upper;
kpeter@806
   173
    CostVector _cost;
kpeter@806
   174
    ValueVector _supply;
kpeter@806
   175
kpeter@806
   176
    ValueVector _res_cap;
kpeter@806
   177
    CostVector _pi;
kpeter@806
   178
    ValueVector _excess;
kpeter@806
   179
    IntVector _excess_nodes;
kpeter@806
   180
    IntVector _deficit_nodes;
kpeter@806
   181
kpeter@806
   182
    Value _delta;
kpeter@810
   183
    int _factor;
kpeter@806
   184
    IntVector _pred;
kpeter@806
   185
kpeter@806
   186
  public:
kpeter@806
   187
  
kpeter@806
   188
    /// \brief Constant for infinite upper bounds (capacities).
kpeter@805
   189
    ///
kpeter@806
   190
    /// Constant for infinite upper bounds (capacities).
kpeter@806
   191
    /// It is \c std::numeric_limits<Value>::infinity() if available,
kpeter@806
   192
    /// \c std::numeric_limits<Value>::max() otherwise.
kpeter@806
   193
    const Value INF;
kpeter@806
   194
kpeter@806
   195
  private:
kpeter@806
   196
kpeter@806
   197
    // Special implementation of the Dijkstra algorithm for finding
kpeter@806
   198
    // shortest paths in the residual network of the digraph with
kpeter@806
   199
    // respect to the reduced arc costs and modifying the node
kpeter@806
   200
    // potentials according to the found distance labels.
kpeter@805
   201
    class ResidualDijkstra
kpeter@805
   202
    {
kpeter@805
   203
    private:
kpeter@805
   204
kpeter@806
   205
      int _node_num;
kpeter@811
   206
      bool _geq;
kpeter@806
   207
      const IntVector &_first_out;
kpeter@806
   208
      const IntVector &_target;
kpeter@806
   209
      const CostVector &_cost;
kpeter@806
   210
      const ValueVector &_res_cap;
kpeter@806
   211
      const ValueVector &_excess;
kpeter@806
   212
      CostVector &_pi;
kpeter@806
   213
      IntVector &_pred;
kpeter@806
   214
      
kpeter@806
   215
      IntVector _proc_nodes;
kpeter@806
   216
      CostVector _dist;
kpeter@806
   217
      
kpeter@805
   218
    public:
kpeter@805
   219
kpeter@806
   220
      ResidualDijkstra(CapacityScaling& cs) :
kpeter@811
   221
        _node_num(cs._node_num), _geq(cs._sum_supply < 0),
kpeter@811
   222
        _first_out(cs._first_out), _target(cs._target), _cost(cs._cost),
kpeter@811
   223
        _res_cap(cs._res_cap), _excess(cs._excess), _pi(cs._pi),
kpeter@811
   224
        _pred(cs._pred), _dist(cs._node_num)
kpeter@805
   225
      {}
kpeter@805
   226
kpeter@806
   227
      int run(int s, Value delta = 1) {
kpeter@807
   228
        RangeMap<int> heap_cross_ref(_node_num, Heap::PRE_HEAP);
kpeter@805
   229
        Heap heap(heap_cross_ref);
kpeter@805
   230
        heap.push(s, 0);
kpeter@806
   231
        _pred[s] = -1;
kpeter@805
   232
        _proc_nodes.clear();
kpeter@805
   233
kpeter@806
   234
        // Process nodes
kpeter@805
   235
        while (!heap.empty() && _excess[heap.top()] > -delta) {
kpeter@806
   236
          int u = heap.top(), v;
kpeter@806
   237
          Cost d = heap.prio() + _pi[u], dn;
kpeter@805
   238
          _dist[u] = heap.prio();
kpeter@806
   239
          _proc_nodes.push_back(u);
kpeter@805
   240
          heap.pop();
kpeter@805
   241
kpeter@806
   242
          // Traverse outgoing residual arcs
kpeter@811
   243
          int last_out = _geq ? _first_out[u+1] : _first_out[u+1] - 1;
kpeter@811
   244
          for (int a = _first_out[u]; a != last_out; ++a) {
kpeter@806
   245
            if (_res_cap[a] < delta) continue;
kpeter@806
   246
            v = _target[a];
kpeter@806
   247
            switch (heap.state(v)) {
kpeter@805
   248
              case Heap::PRE_HEAP:
kpeter@806
   249
                heap.push(v, d + _cost[a] - _pi[v]);
kpeter@806
   250
                _pred[v] = a;
kpeter@805
   251
                break;
kpeter@805
   252
              case Heap::IN_HEAP:
kpeter@806
   253
                dn = d + _cost[a] - _pi[v];
kpeter@806
   254
                if (dn < heap[v]) {
kpeter@806
   255
                  heap.decrease(v, dn);
kpeter@806
   256
                  _pred[v] = a;
kpeter@805
   257
                }
kpeter@805
   258
                break;
kpeter@805
   259
              case Heap::POST_HEAP:
kpeter@805
   260
                break;
kpeter@805
   261
            }
kpeter@805
   262
          }
kpeter@805
   263
        }
kpeter@806
   264
        if (heap.empty()) return -1;
kpeter@805
   265
kpeter@806
   266
        // Update potentials of processed nodes
kpeter@806
   267
        int t = heap.top();
kpeter@806
   268
        Cost dt = heap.prio();
kpeter@806
   269
        for (int i = 0; i < int(_proc_nodes.size()); ++i) {
kpeter@806
   270
          _pi[_proc_nodes[i]] += _dist[_proc_nodes[i]] - dt;
kpeter@806
   271
        }
kpeter@805
   272
kpeter@805
   273
        return t;
kpeter@805
   274
      }
kpeter@805
   275
kpeter@805
   276
    }; //class ResidualDijkstra
kpeter@805
   277
kpeter@805
   278
  public:
kpeter@805
   279
kpeter@807
   280
    /// \name Named Template Parameters
kpeter@807
   281
    /// @{
kpeter@807
   282
kpeter@807
   283
    template <typename T>
kpeter@807
   284
    struct SetHeapTraits : public Traits {
kpeter@807
   285
      typedef T Heap;
kpeter@807
   286
    };
kpeter@807
   287
kpeter@807
   288
    /// \brief \ref named-templ-param "Named parameter" for setting
kpeter@807
   289
    /// \c Heap type.
kpeter@807
   290
    ///
kpeter@807
   291
    /// \ref named-templ-param "Named parameter" for setting \c Heap
kpeter@807
   292
    /// type, which is used for internal Dijkstra computations.
kpeter@807
   293
    /// It must conform to the \ref lemon::concepts::Heap "Heap" concept,
kpeter@807
   294
    /// its priority type must be \c Cost and its cross reference type
kpeter@807
   295
    /// must be \ref RangeMap "RangeMap<int>".
kpeter@807
   296
    template <typename T>
kpeter@807
   297
    struct SetHeap
kpeter@807
   298
      : public CapacityScaling<GR, V, C, SetHeapTraits<T> > {
kpeter@807
   299
      typedef  CapacityScaling<GR, V, C, SetHeapTraits<T> > Create;
kpeter@807
   300
    };
kpeter@807
   301
kpeter@807
   302
    /// @}
kpeter@807
   303
kpeter@863
   304
  protected:
kpeter@863
   305
kpeter@863
   306
    CapacityScaling() {}
kpeter@863
   307
kpeter@807
   308
  public:
kpeter@807
   309
kpeter@806
   310
    /// \brief Constructor.
kpeter@805
   311
    ///
kpeter@806
   312
    /// The constructor of the class.
kpeter@805
   313
    ///
kpeter@806
   314
    /// \param graph The digraph the algorithm runs on.
kpeter@806
   315
    CapacityScaling(const GR& graph) :
kpeter@806
   316
      _graph(graph), _node_id(graph), _arc_idf(graph), _arc_idb(graph),
kpeter@806
   317
      INF(std::numeric_limits<Value>::has_infinity ?
kpeter@806
   318
          std::numeric_limits<Value>::infinity() :
kpeter@806
   319
          std::numeric_limits<Value>::max())
kpeter@805
   320
    {
kpeter@812
   321
      // Check the number types
kpeter@806
   322
      LEMON_ASSERT(std::numeric_limits<Value>::is_signed,
kpeter@806
   323
        "The flow type of CapacityScaling must be signed");
kpeter@806
   324
      LEMON_ASSERT(std::numeric_limits<Cost>::is_signed,
kpeter@806
   325
        "The cost type of CapacityScaling must be signed");
kpeter@806
   326
kpeter@830
   327
      // Reset data structures
kpeter@806
   328
      reset();
kpeter@805
   329
    }
kpeter@805
   330
kpeter@806
   331
    /// \name Parameters
kpeter@806
   332
    /// The parameters of the algorithm can be specified using these
kpeter@806
   333
    /// functions.
kpeter@806
   334
kpeter@806
   335
    /// @{
kpeter@806
   336
kpeter@806
   337
    /// \brief Set the lower bounds on the arcs.
kpeter@805
   338
    ///
kpeter@806
   339
    /// This function sets the lower bounds on the arcs.
kpeter@806
   340
    /// If it is not used before calling \ref run(), the lower bounds
kpeter@806
   341
    /// will be set to zero on all arcs.
kpeter@805
   342
    ///
kpeter@806
   343
    /// \param map An arc map storing the lower bounds.
kpeter@806
   344
    /// Its \c Value type must be convertible to the \c Value type
kpeter@806
   345
    /// of the algorithm.
kpeter@806
   346
    ///
kpeter@806
   347
    /// \return <tt>(*this)</tt>
kpeter@806
   348
    template <typename LowerMap>
kpeter@806
   349
    CapacityScaling& lowerMap(const LowerMap& map) {
kpeter@806
   350
      _have_lower = true;
kpeter@806
   351
      for (ArcIt a(_graph); a != INVALID; ++a) {
kpeter@806
   352
        _lower[_arc_idf[a]] = map[a];
kpeter@806
   353
        _lower[_arc_idb[a]] = map[a];
kpeter@805
   354
      }
kpeter@805
   355
      return *this;
kpeter@805
   356
    }
kpeter@805
   357
kpeter@806
   358
    /// \brief Set the upper bounds (capacities) on the arcs.
kpeter@805
   359
    ///
kpeter@806
   360
    /// This function sets the upper bounds (capacities) on the arcs.
kpeter@806
   361
    /// If it is not used before calling \ref run(), the upper bounds
kpeter@806
   362
    /// will be set to \ref INF on all arcs (i.e. the flow value will be
kpeter@812
   363
    /// unbounded from above).
kpeter@805
   364
    ///
kpeter@806
   365
    /// \param map An arc map storing the upper bounds.
kpeter@806
   366
    /// Its \c Value type must be convertible to the \c Value type
kpeter@806
   367
    /// of the algorithm.
kpeter@806
   368
    ///
kpeter@806
   369
    /// \return <tt>(*this)</tt>
kpeter@806
   370
    template<typename UpperMap>
kpeter@806
   371
    CapacityScaling& upperMap(const UpperMap& map) {
kpeter@806
   372
      for (ArcIt a(_graph); a != INVALID; ++a) {
kpeter@806
   373
        _upper[_arc_idf[a]] = map[a];
kpeter@805
   374
      }
kpeter@805
   375
      return *this;
kpeter@805
   376
    }
kpeter@805
   377
kpeter@806
   378
    /// \brief Set the costs of the arcs.
kpeter@806
   379
    ///
kpeter@806
   380
    /// This function sets the costs of the arcs.
kpeter@806
   381
    /// If it is not used before calling \ref run(), the costs
kpeter@806
   382
    /// will be set to \c 1 on all arcs.
kpeter@806
   383
    ///
kpeter@806
   384
    /// \param map An arc map storing the costs.
kpeter@806
   385
    /// Its \c Value type must be convertible to the \c Cost type
kpeter@806
   386
    /// of the algorithm.
kpeter@806
   387
    ///
kpeter@806
   388
    /// \return <tt>(*this)</tt>
kpeter@806
   389
    template<typename CostMap>
kpeter@806
   390
    CapacityScaling& costMap(const CostMap& map) {
kpeter@806
   391
      for (ArcIt a(_graph); a != INVALID; ++a) {
kpeter@806
   392
        _cost[_arc_idf[a]] =  map[a];
kpeter@806
   393
        _cost[_arc_idb[a]] = -map[a];
kpeter@806
   394
      }
kpeter@806
   395
      return *this;
kpeter@806
   396
    }
kpeter@806
   397
kpeter@806
   398
    /// \brief Set the supply values of the nodes.
kpeter@806
   399
    ///
kpeter@806
   400
    /// This function sets the supply values of the nodes.
kpeter@806
   401
    /// If neither this function nor \ref stSupply() is used before
kpeter@806
   402
    /// calling \ref run(), the supply of each node will be set to zero.
kpeter@806
   403
    ///
kpeter@806
   404
    /// \param map A node map storing the supply values.
kpeter@806
   405
    /// Its \c Value type must be convertible to the \c Value type
kpeter@806
   406
    /// of the algorithm.
kpeter@806
   407
    ///
kpeter@806
   408
    /// \return <tt>(*this)</tt>
kpeter@806
   409
    template<typename SupplyMap>
kpeter@806
   410
    CapacityScaling& supplyMap(const SupplyMap& map) {
kpeter@806
   411
      for (NodeIt n(_graph); n != INVALID; ++n) {
kpeter@806
   412
        _supply[_node_id[n]] = map[n];
kpeter@806
   413
      }
kpeter@806
   414
      return *this;
kpeter@806
   415
    }
kpeter@806
   416
kpeter@806
   417
    /// \brief Set single source and target nodes and a supply value.
kpeter@806
   418
    ///
kpeter@806
   419
    /// This function sets a single source node and a single target node
kpeter@806
   420
    /// and the required flow value.
kpeter@806
   421
    /// If neither this function nor \ref supplyMap() is used before
kpeter@806
   422
    /// calling \ref run(), the supply of each node will be set to zero.
kpeter@806
   423
    ///
kpeter@806
   424
    /// Using this function has the same effect as using \ref supplyMap()
kpeter@806
   425
    /// with such a map in which \c k is assigned to \c s, \c -k is
kpeter@806
   426
    /// assigned to \c t and all other nodes have zero supply value.
kpeter@806
   427
    ///
kpeter@806
   428
    /// \param s The source node.
kpeter@806
   429
    /// \param t The target node.
kpeter@806
   430
    /// \param k The required amount of flow from node \c s to node \c t
kpeter@806
   431
    /// (i.e. the supply of \c s and the demand of \c t).
kpeter@806
   432
    ///
kpeter@806
   433
    /// \return <tt>(*this)</tt>
kpeter@806
   434
    CapacityScaling& stSupply(const Node& s, const Node& t, Value k) {
kpeter@806
   435
      for (int i = 0; i != _node_num; ++i) {
kpeter@806
   436
        _supply[i] = 0;
kpeter@806
   437
      }
kpeter@806
   438
      _supply[_node_id[s]] =  k;
kpeter@806
   439
      _supply[_node_id[t]] = -k;
kpeter@806
   440
      return *this;
kpeter@806
   441
    }
kpeter@806
   442
    
kpeter@806
   443
    /// @}
kpeter@806
   444
kpeter@805
   445
    /// \name Execution control
kpeter@807
   446
    /// The algorithm can be executed using \ref run().
kpeter@805
   447
kpeter@805
   448
    /// @{
kpeter@805
   449
kpeter@805
   450
    /// \brief Run the algorithm.
kpeter@805
   451
    ///
kpeter@805
   452
    /// This function runs the algorithm.
kpeter@806
   453
    /// The paramters can be specified using functions \ref lowerMap(),
kpeter@806
   454
    /// \ref upperMap(), \ref costMap(), \ref supplyMap(), \ref stSupply().
kpeter@806
   455
    /// For example,
kpeter@806
   456
    /// \code
kpeter@806
   457
    ///   CapacityScaling<ListDigraph> cs(graph);
kpeter@806
   458
    ///   cs.lowerMap(lower).upperMap(upper).costMap(cost)
kpeter@806
   459
    ///     .supplyMap(sup).run();
kpeter@806
   460
    /// \endcode
kpeter@806
   461
    ///
kpeter@830
   462
    /// This function can be called more than once. All the given parameters
kpeter@830
   463
    /// are kept for the next call, unless \ref resetParams() or \ref reset()
kpeter@830
   464
    /// is used, thus only the modified parameters have to be set again.
kpeter@830
   465
    /// If the underlying digraph was also modified after the construction
kpeter@830
   466
    /// of the class (or the last \ref reset() call), then the \ref reset()
kpeter@830
   467
    /// function must be called.
kpeter@805
   468
    ///
kpeter@810
   469
    /// \param factor The capacity scaling factor. It must be larger than
kpeter@810
   470
    /// one to use scaling. If it is less or equal to one, then scaling
kpeter@810
   471
    /// will be disabled.
kpeter@805
   472
    ///
kpeter@806
   473
    /// \return \c INFEASIBLE if no feasible flow exists,
kpeter@806
   474
    /// \n \c OPTIMAL if the problem has optimal solution
kpeter@806
   475
    /// (i.e. it is feasible and bounded), and the algorithm has found
kpeter@806
   476
    /// optimal flow and node potentials (primal and dual solutions),
kpeter@806
   477
    /// \n \c UNBOUNDED if the digraph contains an arc of negative cost
kpeter@806
   478
    /// and infinite upper bound. It means that the objective function
kpeter@812
   479
    /// is unbounded on that arc, however, note that it could actually be
kpeter@806
   480
    /// bounded over the feasible flows, but this algroithm cannot handle
kpeter@806
   481
    /// these cases.
kpeter@806
   482
    ///
kpeter@806
   483
    /// \see ProblemType
kpeter@830
   484
    /// \see resetParams(), reset()
kpeter@810
   485
    ProblemType run(int factor = 4) {
kpeter@810
   486
      _factor = factor;
kpeter@810
   487
      ProblemType pt = init();
kpeter@806
   488
      if (pt != OPTIMAL) return pt;
kpeter@806
   489
      return start();
kpeter@806
   490
    }
kpeter@806
   491
kpeter@806
   492
    /// \brief Reset all the parameters that have been given before.
kpeter@806
   493
    ///
kpeter@806
   494
    /// This function resets all the paramaters that have been given
kpeter@806
   495
    /// before using functions \ref lowerMap(), \ref upperMap(),
kpeter@806
   496
    /// \ref costMap(), \ref supplyMap(), \ref stSupply().
kpeter@806
   497
    ///
kpeter@830
   498
    /// It is useful for multiple \ref run() calls. Basically, all the given
kpeter@830
   499
    /// parameters are kept for the next \ref run() call, unless
kpeter@830
   500
    /// \ref resetParams() or \ref reset() is used.
kpeter@830
   501
    /// If the underlying digraph was also modified after the construction
kpeter@830
   502
    /// of the class or the last \ref reset() call, then the \ref reset()
kpeter@830
   503
    /// function must be used, otherwise \ref resetParams() is sufficient.
kpeter@806
   504
    ///
kpeter@806
   505
    /// For example,
kpeter@806
   506
    /// \code
kpeter@806
   507
    ///   CapacityScaling<ListDigraph> cs(graph);
kpeter@806
   508
    ///
kpeter@806
   509
    ///   // First run
kpeter@806
   510
    ///   cs.lowerMap(lower).upperMap(upper).costMap(cost)
kpeter@806
   511
    ///     .supplyMap(sup).run();
kpeter@806
   512
    ///
kpeter@830
   513
    ///   // Run again with modified cost map (resetParams() is not called,
kpeter@806
   514
    ///   // so only the cost map have to be set again)
kpeter@806
   515
    ///   cost[e] += 100;
kpeter@806
   516
    ///   cs.costMap(cost).run();
kpeter@806
   517
    ///
kpeter@830
   518
    ///   // Run again from scratch using resetParams()
kpeter@806
   519
    ///   // (the lower bounds will be set to zero on all arcs)
kpeter@830
   520
    ///   cs.resetParams();
kpeter@806
   521
    ///   cs.upperMap(capacity).costMap(cost)
kpeter@806
   522
    ///     .supplyMap(sup).run();
kpeter@806
   523
    /// \endcode
kpeter@806
   524
    ///
kpeter@806
   525
    /// \return <tt>(*this)</tt>
kpeter@830
   526
    ///
kpeter@830
   527
    /// \see reset(), run()
kpeter@830
   528
    CapacityScaling& resetParams() {
kpeter@806
   529
      for (int i = 0; i != _node_num; ++i) {
kpeter@806
   530
        _supply[i] = 0;
kpeter@806
   531
      }
kpeter@806
   532
      for (int j = 0; j != _res_arc_num; ++j) {
kpeter@806
   533
        _lower[j] = 0;
kpeter@806
   534
        _upper[j] = INF;
kpeter@806
   535
        _cost[j] = _forward[j] ? 1 : -1;
kpeter@806
   536
      }
kpeter@806
   537
      _have_lower = false;
kpeter@806
   538
      return *this;
kpeter@805
   539
    }
kpeter@805
   540
kpeter@830
   541
    /// \brief Reset the internal data structures and all the parameters
kpeter@830
   542
    /// that have been given before.
kpeter@830
   543
    ///
kpeter@830
   544
    /// This function resets the internal data structures and all the
kpeter@830
   545
    /// paramaters that have been given before using functions \ref lowerMap(),
kpeter@830
   546
    /// \ref upperMap(), \ref costMap(), \ref supplyMap(), \ref stSupply().
kpeter@830
   547
    ///
kpeter@830
   548
    /// It is useful for multiple \ref run() calls. Basically, all the given
kpeter@830
   549
    /// parameters are kept for the next \ref run() call, unless
kpeter@830
   550
    /// \ref resetParams() or \ref reset() is used.
kpeter@830
   551
    /// If the underlying digraph was also modified after the construction
kpeter@830
   552
    /// of the class or the last \ref reset() call, then the \ref reset()
kpeter@830
   553
    /// function must be used, otherwise \ref resetParams() is sufficient.
kpeter@830
   554
    ///
kpeter@830
   555
    /// See \ref resetParams() for examples.
kpeter@830
   556
    ///
kpeter@830
   557
    /// \return <tt>(*this)</tt>
kpeter@830
   558
    ///
kpeter@830
   559
    /// \see resetParams(), run()
kpeter@830
   560
    CapacityScaling& reset() {
kpeter@830
   561
      // Resize vectors
kpeter@830
   562
      _node_num = countNodes(_graph);
kpeter@830
   563
      _arc_num = countArcs(_graph);
kpeter@830
   564
      _res_arc_num = 2 * (_arc_num + _node_num);
kpeter@830
   565
      _root = _node_num;
kpeter@830
   566
      ++_node_num;
kpeter@830
   567
kpeter@830
   568
      _first_out.resize(_node_num + 1);
kpeter@830
   569
      _forward.resize(_res_arc_num);
kpeter@830
   570
      _source.resize(_res_arc_num);
kpeter@830
   571
      _target.resize(_res_arc_num);
kpeter@830
   572
      _reverse.resize(_res_arc_num);
kpeter@830
   573
kpeter@830
   574
      _lower.resize(_res_arc_num);
kpeter@830
   575
      _upper.resize(_res_arc_num);
kpeter@830
   576
      _cost.resize(_res_arc_num);
kpeter@830
   577
      _supply.resize(_node_num);
kpeter@830
   578
      
kpeter@830
   579
      _res_cap.resize(_res_arc_num);
kpeter@830
   580
      _pi.resize(_node_num);
kpeter@830
   581
      _excess.resize(_node_num);
kpeter@830
   582
      _pred.resize(_node_num);
kpeter@830
   583
kpeter@830
   584
      // Copy the graph
kpeter@830
   585
      int i = 0, j = 0, k = 2 * _arc_num + _node_num - 1;
kpeter@830
   586
      for (NodeIt n(_graph); n != INVALID; ++n, ++i) {
kpeter@830
   587
        _node_id[n] = i;
kpeter@830
   588
      }
kpeter@830
   589
      i = 0;
kpeter@830
   590
      for (NodeIt n(_graph); n != INVALID; ++n, ++i) {
kpeter@830
   591
        _first_out[i] = j;
kpeter@830
   592
        for (OutArcIt a(_graph, n); a != INVALID; ++a, ++j) {
kpeter@830
   593
          _arc_idf[a] = j;
kpeter@830
   594
          _forward[j] = true;
kpeter@830
   595
          _source[j] = i;
kpeter@830
   596
          _target[j] = _node_id[_graph.runningNode(a)];
kpeter@830
   597
        }
kpeter@830
   598
        for (InArcIt a(_graph, n); a != INVALID; ++a, ++j) {
kpeter@830
   599
          _arc_idb[a] = j;
kpeter@830
   600
          _forward[j] = false;
kpeter@830
   601
          _source[j] = i;
kpeter@830
   602
          _target[j] = _node_id[_graph.runningNode(a)];
kpeter@830
   603
        }
kpeter@830
   604
        _forward[j] = false;
kpeter@830
   605
        _source[j] = i;
kpeter@830
   606
        _target[j] = _root;
kpeter@830
   607
        _reverse[j] = k;
kpeter@830
   608
        _forward[k] = true;
kpeter@830
   609
        _source[k] = _root;
kpeter@830
   610
        _target[k] = i;
kpeter@830
   611
        _reverse[k] = j;
kpeter@830
   612
        ++j; ++k;
kpeter@830
   613
      }
kpeter@830
   614
      _first_out[i] = j;
kpeter@830
   615
      _first_out[_node_num] = k;
kpeter@830
   616
      for (ArcIt a(_graph); a != INVALID; ++a) {
kpeter@830
   617
        int fi = _arc_idf[a];
kpeter@830
   618
        int bi = _arc_idb[a];
kpeter@830
   619
        _reverse[fi] = bi;
kpeter@830
   620
        _reverse[bi] = fi;
kpeter@830
   621
      }
kpeter@830
   622
      
kpeter@830
   623
      // Reset parameters
kpeter@830
   624
      resetParams();
kpeter@830
   625
      return *this;
kpeter@830
   626
    }
kpeter@830
   627
kpeter@805
   628
    /// @}
kpeter@805
   629
kpeter@805
   630
    /// \name Query Functions
kpeter@805
   631
    /// The results of the algorithm can be obtained using these
kpeter@805
   632
    /// functions.\n
kpeter@806
   633
    /// The \ref run() function must be called before using them.
kpeter@805
   634
kpeter@805
   635
    /// @{
kpeter@805
   636
kpeter@806
   637
    /// \brief Return the total cost of the found flow.
kpeter@805
   638
    ///
kpeter@806
   639
    /// This function returns the total cost of the found flow.
kpeter@806
   640
    /// Its complexity is O(e).
kpeter@806
   641
    ///
kpeter@806
   642
    /// \note The return type of the function can be specified as a
kpeter@806
   643
    /// template parameter. For example,
kpeter@806
   644
    /// \code
kpeter@806
   645
    ///   cs.totalCost<double>();
kpeter@806
   646
    /// \endcode
kpeter@806
   647
    /// It is useful if the total cost cannot be stored in the \c Cost
kpeter@806
   648
    /// type of the algorithm, which is the default return type of the
kpeter@806
   649
    /// function.
kpeter@805
   650
    ///
kpeter@805
   651
    /// \pre \ref run() must be called before using this function.
kpeter@806
   652
    template <typename Number>
kpeter@806
   653
    Number totalCost() const {
kpeter@806
   654
      Number c = 0;
kpeter@806
   655
      for (ArcIt a(_graph); a != INVALID; ++a) {
kpeter@806
   656
        int i = _arc_idb[a];
kpeter@806
   657
        c += static_cast<Number>(_res_cap[i]) *
kpeter@806
   658
             (-static_cast<Number>(_cost[i]));
kpeter@806
   659
      }
kpeter@806
   660
      return c;
kpeter@805
   661
    }
kpeter@805
   662
kpeter@806
   663
#ifndef DOXYGEN
kpeter@806
   664
    Cost totalCost() const {
kpeter@806
   665
      return totalCost<Cost>();
kpeter@805
   666
    }
kpeter@806
   667
#endif
kpeter@805
   668
kpeter@805
   669
    /// \brief Return the flow on the given arc.
kpeter@805
   670
    ///
kpeter@806
   671
    /// This function returns the flow on the given arc.
kpeter@805
   672
    ///
kpeter@805
   673
    /// \pre \ref run() must be called before using this function.
kpeter@806
   674
    Value flow(const Arc& a) const {
kpeter@806
   675
      return _res_cap[_arc_idb[a]];
kpeter@805
   676
    }
kpeter@805
   677
kpeter@806
   678
    /// \brief Return the flow map (the primal solution).
kpeter@805
   679
    ///
kpeter@806
   680
    /// This function copies the flow value on each arc into the given
kpeter@806
   681
    /// map. The \c Value type of the algorithm must be convertible to
kpeter@806
   682
    /// the \c Value type of the map.
kpeter@805
   683
    ///
kpeter@805
   684
    /// \pre \ref run() must be called before using this function.
kpeter@806
   685
    template <typename FlowMap>
kpeter@806
   686
    void flowMap(FlowMap &map) const {
kpeter@806
   687
      for (ArcIt a(_graph); a != INVALID; ++a) {
kpeter@806
   688
        map.set(a, _res_cap[_arc_idb[a]]);
kpeter@806
   689
      }
kpeter@805
   690
    }
kpeter@805
   691
kpeter@806
   692
    /// \brief Return the potential (dual value) of the given node.
kpeter@805
   693
    ///
kpeter@806
   694
    /// This function returns the potential (dual value) of the
kpeter@806
   695
    /// given node.
kpeter@805
   696
    ///
kpeter@805
   697
    /// \pre \ref run() must be called before using this function.
kpeter@806
   698
    Cost potential(const Node& n) const {
kpeter@806
   699
      return _pi[_node_id[n]];
kpeter@806
   700
    }
kpeter@806
   701
kpeter@806
   702
    /// \brief Return the potential map (the dual solution).
kpeter@806
   703
    ///
kpeter@806
   704
    /// This function copies the potential (dual value) of each node
kpeter@806
   705
    /// into the given map.
kpeter@806
   706
    /// The \c Cost type of the algorithm must be convertible to the
kpeter@806
   707
    /// \c Value type of the map.
kpeter@806
   708
    ///
kpeter@806
   709
    /// \pre \ref run() must be called before using this function.
kpeter@806
   710
    template <typename PotentialMap>
kpeter@806
   711
    void potentialMap(PotentialMap &map) const {
kpeter@806
   712
      for (NodeIt n(_graph); n != INVALID; ++n) {
kpeter@806
   713
        map.set(n, _pi[_node_id[n]]);
kpeter@806
   714
      }
kpeter@805
   715
    }
kpeter@805
   716
kpeter@805
   717
    /// @}
kpeter@805
   718
kpeter@805
   719
  private:
kpeter@805
   720
kpeter@806
   721
    // Initialize the algorithm
kpeter@810
   722
    ProblemType init() {
kpeter@821
   723
      if (_node_num <= 1) return INFEASIBLE;
kpeter@805
   724
kpeter@806
   725
      // Check the sum of supply values
kpeter@806
   726
      _sum_supply = 0;
kpeter@806
   727
      for (int i = 0; i != _root; ++i) {
kpeter@806
   728
        _sum_supply += _supply[i];
kpeter@805
   729
      }
kpeter@806
   730
      if (_sum_supply > 0) return INFEASIBLE;
kpeter@806
   731
      
kpeter@811
   732
      // Initialize vectors
kpeter@806
   733
      for (int i = 0; i != _root; ++i) {
kpeter@806
   734
        _pi[i] = 0;
kpeter@806
   735
        _excess[i] = _supply[i];
kpeter@805
   736
      }
kpeter@805
   737
kpeter@806
   738
      // Remove non-zero lower bounds
kpeter@811
   739
      const Value MAX = std::numeric_limits<Value>::max();
kpeter@811
   740
      int last_out;
kpeter@806
   741
      if (_have_lower) {
kpeter@806
   742
        for (int i = 0; i != _root; ++i) {
kpeter@811
   743
          last_out = _first_out[i+1];
kpeter@811
   744
          for (int j = _first_out[i]; j != last_out; ++j) {
kpeter@806
   745
            if (_forward[j]) {
kpeter@806
   746
              Value c = _lower[j];
kpeter@806
   747
              if (c >= 0) {
kpeter@811
   748
                _res_cap[j] = _upper[j] < MAX ? _upper[j] - c : INF;
kpeter@806
   749
              } else {
kpeter@811
   750
                _res_cap[j] = _upper[j] < MAX + c ? _upper[j] - c : INF;
kpeter@806
   751
              }
kpeter@806
   752
              _excess[i] -= c;
kpeter@806
   753
              _excess[_target[j]] += c;
kpeter@806
   754
            } else {
kpeter@806
   755
              _res_cap[j] = 0;
kpeter@806
   756
            }
kpeter@806
   757
          }
kpeter@806
   758
        }
kpeter@806
   759
      } else {
kpeter@806
   760
        for (int j = 0; j != _res_arc_num; ++j) {
kpeter@806
   761
          _res_cap[j] = _forward[j] ? _upper[j] : 0;
kpeter@806
   762
        }
kpeter@806
   763
      }
kpeter@805
   764
kpeter@806
   765
      // Handle negative costs
kpeter@811
   766
      for (int i = 0; i != _root; ++i) {
kpeter@811
   767
        last_out = _first_out[i+1] - 1;
kpeter@811
   768
        for (int j = _first_out[i]; j != last_out; ++j) {
kpeter@811
   769
          Value rc = _res_cap[j];
kpeter@811
   770
          if (_cost[j] < 0 && rc > 0) {
kpeter@811
   771
            if (rc >= MAX) return UNBOUNDED;
kpeter@811
   772
            _excess[i] -= rc;
kpeter@811
   773
            _excess[_target[j]] += rc;
kpeter@811
   774
            _res_cap[j] = 0;
kpeter@811
   775
            _res_cap[_reverse[j]] += rc;
kpeter@806
   776
          }
kpeter@806
   777
        }
kpeter@806
   778
      }
kpeter@806
   779
      
kpeter@806
   780
      // Handle GEQ supply type
kpeter@806
   781
      if (_sum_supply < 0) {
kpeter@806
   782
        _pi[_root] = 0;
kpeter@806
   783
        _excess[_root] = -_sum_supply;
kpeter@806
   784
        for (int a = _first_out[_root]; a != _res_arc_num; ++a) {
kpeter@811
   785
          int ra = _reverse[a];
kpeter@811
   786
          _res_cap[a] = -_sum_supply + 1;
kpeter@811
   787
          _res_cap[ra] = 0;
kpeter@806
   788
          _cost[a] = 0;
kpeter@811
   789
          _cost[ra] = 0;
kpeter@806
   790
        }
kpeter@806
   791
      } else {
kpeter@806
   792
        _pi[_root] = 0;
kpeter@806
   793
        _excess[_root] = 0;
kpeter@806
   794
        for (int a = _first_out[_root]; a != _res_arc_num; ++a) {
kpeter@811
   795
          int ra = _reverse[a];
kpeter@806
   796
          _res_cap[a] = 1;
kpeter@811
   797
          _res_cap[ra] = 0;
kpeter@806
   798
          _cost[a] = 0;
kpeter@811
   799
          _cost[ra] = 0;
kpeter@806
   800
        }
kpeter@806
   801
      }
kpeter@806
   802
kpeter@806
   803
      // Initialize delta value
kpeter@810
   804
      if (_factor > 1) {
kpeter@805
   805
        // With scaling
kpeter@839
   806
        Value max_sup = 0, max_dem = 0, max_cap = 0;
kpeter@839
   807
        for (int i = 0; i != _root; ++i) {
kpeter@811
   808
          Value ex = _excess[i];
kpeter@811
   809
          if ( ex > max_sup) max_sup =  ex;
kpeter@811
   810
          if (-ex > max_dem) max_dem = -ex;
kpeter@839
   811
          int last_out = _first_out[i+1] - 1;
kpeter@839
   812
          for (int j = _first_out[i]; j != last_out; ++j) {
kpeter@839
   813
            if (_res_cap[j] > max_cap) max_cap = _res_cap[j];
kpeter@839
   814
          }
kpeter@805
   815
        }
kpeter@805
   816
        max_sup = std::min(std::min(max_sup, max_dem), max_cap);
kpeter@810
   817
        for (_delta = 1; 2 * _delta <= max_sup; _delta *= 2) ;
kpeter@805
   818
      } else {
kpeter@805
   819
        // Without scaling
kpeter@805
   820
        _delta = 1;
kpeter@805
   821
      }
kpeter@805
   822
kpeter@806
   823
      return OPTIMAL;
kpeter@805
   824
    }
kpeter@805
   825
kpeter@806
   826
    ProblemType start() {
kpeter@806
   827
      // Execute the algorithm
kpeter@806
   828
      ProblemType pt;
kpeter@805
   829
      if (_delta > 1)
kpeter@806
   830
        pt = startWithScaling();
kpeter@805
   831
      else
kpeter@806
   832
        pt = startWithoutScaling();
kpeter@806
   833
kpeter@806
   834
      // Handle non-zero lower bounds
kpeter@806
   835
      if (_have_lower) {
kpeter@811
   836
        int limit = _first_out[_root];
kpeter@811
   837
        for (int j = 0; j != limit; ++j) {
kpeter@806
   838
          if (!_forward[j]) _res_cap[j] += _lower[j];
kpeter@806
   839
        }
kpeter@806
   840
      }
kpeter@806
   841
kpeter@806
   842
      // Shift potentials if necessary
kpeter@806
   843
      Cost pr = _pi[_root];
kpeter@806
   844
      if (_sum_supply < 0 || pr > 0) {
kpeter@806
   845
        for (int i = 0; i != _node_num; ++i) {
kpeter@806
   846
          _pi[i] -= pr;
kpeter@806
   847
        }        
kpeter@806
   848
      }
kpeter@806
   849
      
kpeter@806
   850
      return pt;
kpeter@805
   851
    }
kpeter@805
   852
kpeter@806
   853
    // Execute the capacity scaling algorithm
kpeter@806
   854
    ProblemType startWithScaling() {
kpeter@807
   855
      // Perform capacity scaling phases
kpeter@806
   856
      int s, t;
kpeter@806
   857
      ResidualDijkstra _dijkstra(*this);
kpeter@805
   858
      while (true) {
kpeter@806
   859
        // Saturate all arcs not satisfying the optimality condition
kpeter@811
   860
        int last_out;
kpeter@806
   861
        for (int u = 0; u != _node_num; ++u) {
kpeter@811
   862
          last_out = _sum_supply < 0 ?
kpeter@811
   863
            _first_out[u+1] : _first_out[u+1] - 1;
kpeter@811
   864
          for (int a = _first_out[u]; a != last_out; ++a) {
kpeter@806
   865
            int v = _target[a];
kpeter@806
   866
            Cost c = _cost[a] + _pi[u] - _pi[v];
kpeter@806
   867
            Value rc = _res_cap[a];
kpeter@806
   868
            if (c < 0 && rc >= _delta) {
kpeter@806
   869
              _excess[u] -= rc;
kpeter@806
   870
              _excess[v] += rc;
kpeter@806
   871
              _res_cap[a] = 0;
kpeter@806
   872
              _res_cap[_reverse[a]] += rc;
kpeter@806
   873
            }
kpeter@805
   874
          }
kpeter@805
   875
        }
kpeter@805
   876
kpeter@806
   877
        // Find excess nodes and deficit nodes
kpeter@805
   878
        _excess_nodes.clear();
kpeter@805
   879
        _deficit_nodes.clear();
kpeter@806
   880
        for (int u = 0; u != _node_num; ++u) {
kpeter@811
   881
          Value ex = _excess[u];
kpeter@811
   882
          if (ex >=  _delta) _excess_nodes.push_back(u);
kpeter@811
   883
          if (ex <= -_delta) _deficit_nodes.push_back(u);
kpeter@805
   884
        }
kpeter@805
   885
        int next_node = 0, next_def_node = 0;
kpeter@805
   886
kpeter@806
   887
        // Find augmenting shortest paths
kpeter@805
   888
        while (next_node < int(_excess_nodes.size())) {
kpeter@806
   889
          // Check deficit nodes
kpeter@805
   890
          if (_delta > 1) {
kpeter@805
   891
            bool delta_deficit = false;
kpeter@805
   892
            for ( ; next_def_node < int(_deficit_nodes.size());
kpeter@805
   893
                    ++next_def_node ) {
kpeter@805
   894
              if (_excess[_deficit_nodes[next_def_node]] <= -_delta) {
kpeter@805
   895
                delta_deficit = true;
kpeter@805
   896
                break;
kpeter@805
   897
              }
kpeter@805
   898
            }
kpeter@805
   899
            if (!delta_deficit) break;
kpeter@805
   900
          }
kpeter@805
   901
kpeter@806
   902
          // Run Dijkstra in the residual network
kpeter@805
   903
          s = _excess_nodes[next_node];
kpeter@806
   904
          if ((t = _dijkstra.run(s, _delta)) == -1) {
kpeter@805
   905
            if (_delta > 1) {
kpeter@805
   906
              ++next_node;
kpeter@805
   907
              continue;
kpeter@805
   908
            }
kpeter@806
   909
            return INFEASIBLE;
kpeter@805
   910
          }
kpeter@805
   911
kpeter@806
   912
          // Augment along a shortest path from s to t
kpeter@806
   913
          Value d = std::min(_excess[s], -_excess[t]);
kpeter@806
   914
          int u = t;
kpeter@806
   915
          int a;
kpeter@805
   916
          if (d > _delta) {
kpeter@806
   917
            while ((a = _pred[u]) != -1) {
kpeter@806
   918
              if (_res_cap[a] < d) d = _res_cap[a];
kpeter@806
   919
              u = _source[a];
kpeter@805
   920
            }
kpeter@805
   921
          }
kpeter@805
   922
          u = t;
kpeter@806
   923
          while ((a = _pred[u]) != -1) {
kpeter@806
   924
            _res_cap[a] -= d;
kpeter@806
   925
            _res_cap[_reverse[a]] += d;
kpeter@806
   926
            u = _source[a];
kpeter@805
   927
          }
kpeter@805
   928
          _excess[s] -= d;
kpeter@805
   929
          _excess[t] += d;
kpeter@805
   930
kpeter@805
   931
          if (_excess[s] < _delta) ++next_node;
kpeter@805
   932
        }
kpeter@805
   933
kpeter@805
   934
        if (_delta == 1) break;
kpeter@810
   935
        _delta = _delta <= _factor ? 1 : _delta / _factor;
kpeter@805
   936
      }
kpeter@805
   937
kpeter@806
   938
      return OPTIMAL;
kpeter@805
   939
    }
kpeter@805
   940
kpeter@806
   941
    // Execute the successive shortest path algorithm
kpeter@806
   942
    ProblemType startWithoutScaling() {
kpeter@806
   943
      // Find excess nodes
kpeter@806
   944
      _excess_nodes.clear();
kpeter@806
   945
      for (int i = 0; i != _node_num; ++i) {
kpeter@806
   946
        if (_excess[i] > 0) _excess_nodes.push_back(i);
kpeter@806
   947
      }
kpeter@806
   948
      if (_excess_nodes.size() == 0) return OPTIMAL;
kpeter@805
   949
      int next_node = 0;
kpeter@805
   950
kpeter@806
   951
      // Find shortest paths
kpeter@806
   952
      int s, t;
kpeter@806
   953
      ResidualDijkstra _dijkstra(*this);
kpeter@805
   954
      while ( _excess[_excess_nodes[next_node]] > 0 ||
kpeter@805
   955
              ++next_node < int(_excess_nodes.size()) )
kpeter@805
   956
      {
kpeter@806
   957
        // Run Dijkstra in the residual network
kpeter@805
   958
        s = _excess_nodes[next_node];
kpeter@806
   959
        if ((t = _dijkstra.run(s)) == -1) return INFEASIBLE;
kpeter@805
   960
kpeter@806
   961
        // Augment along a shortest path from s to t
kpeter@806
   962
        Value d = std::min(_excess[s], -_excess[t]);
kpeter@806
   963
        int u = t;
kpeter@806
   964
        int a;
kpeter@805
   965
        if (d > 1) {
kpeter@806
   966
          while ((a = _pred[u]) != -1) {
kpeter@806
   967
            if (_res_cap[a] < d) d = _res_cap[a];
kpeter@806
   968
            u = _source[a];
kpeter@805
   969
          }
kpeter@805
   970
        }
kpeter@805
   971
        u = t;
kpeter@806
   972
        while ((a = _pred[u]) != -1) {
kpeter@806
   973
          _res_cap[a] -= d;
kpeter@806
   974
          _res_cap[_reverse[a]] += d;
kpeter@806
   975
          u = _source[a];
kpeter@805
   976
        }
kpeter@805
   977
        _excess[s] -= d;
kpeter@805
   978
        _excess[t] += d;
kpeter@805
   979
      }
kpeter@805
   980
kpeter@806
   981
      return OPTIMAL;
kpeter@805
   982
    }
kpeter@805
   983
kpeter@805
   984
  }; //class CapacityScaling
kpeter@805
   985
kpeter@805
   986
  ///@}
kpeter@805
   987
kpeter@805
   988
} //namespace lemon
kpeter@805
   989
kpeter@805
   990
#endif //LEMON_CAPACITY_SCALING_H