RhodeCode

    /// \brief Reset the internal data structures and all the parameters

    /// that have been given before.

    /// This function resets the internal data structures and all the

    /// paramaters that have been given before using functions \ref lowerMap(),

    /// \ref upperMap(), \ref costMap(), \ref supplyMap(), \ref stSupply().

    /// It is useful for multiple \ref run() calls. By default, all the given

    /// parameters are kept for the next \ref run() call, unless

    /// \ref resetParams() or \ref reset() is used.

    /// If the underlying digraph was also modified after the construction

    /// of the class or the last \ref reset() call, then the \ref reset()

    /// function must be used, otherwise \ref resetParams() is sufficient.

    ///

    /// See \ref resetParams() for examples.

    ///

    ///

    /// \see resetParams(), run()

      return OPTIMAL;

    }

    // Execute the algorithm and transform the results

    void start(Method method) {

      const int MAX_PARTIAL_PATH_LENGTH = 4;

          startAugment(MAX_PARTIAL_PATH_LENGTH);

          Value delta = _res_cap[a];

          if (delta > 0) {

            if (_cost[a] + pi_u - _pi[v] < 0) {

      }

      const int bucket_end = _root + 1;

      int b0 = bucket_end;

          _bucket_next[i] = b0;

          _bucket_prev[b0] = i;

          b0 = i;

      _buckets[0] = b0;

                if (nrc < LargeCost(_max_rank)) {

                  new_rank_v = r + 1 + static_cast<int>(nrc);

                }

                      int pv = _bucket_prev[v], nv = _bucket_next[v];

                      _bucket_next[pv] = nv;

                      _bucket_prev[nv] = pv;

                  // Insert v into its new bucket

                  int nv = _buckets[new_rank_v];

                  _bucket_next[v] = nv;

                  _bucket_prev[nv] = v;