RhodeCode

    /// \ref NetworkSimplex provides five different implementations for

    /// the pivot strategy that significantly affects the running time

    /// According to experimental tests conducted on various problem

    /// instances, \ref BLOCK_SEARCH "Block Search" and

    /// \ref ALTERING_LIST "Altering Candidate List" rules turned out

    /// to be the most efficient.

    /// Since \ref BLOCK_SEARCH "Block Search" is a simpler strategy that

    /// seemed to be slightly more robust, it is used by default.

    /// However, another pivot rule can easily be selected using the

    /// \ref run() function with the proper parameter.

      /// It keeps only a few of the best eligible arcs from the former

          return _map[left] < _map[right];

        const double HEAD_LENGTH_FACTOR = 0.01;

          c = _state[e] * (_cost[e] + _pi[_source[e]] - _pi[_target[e]]);

          if (c < 0) {

            _cand_cost[e] = c;

        // Perform partial sort operation on the candidate list

        int new_length = std::min(_head_length + 1, _curr_length);

        std::partial_sort(_candidates.begin(), _candidates.begin() + new_length,

                          _candidates.begin() + _curr_length, _sort_func);

        // Select the entering arc and remove it from the list

        _candidates[0] = _candidates[new_length - 1];

        _curr_length = new_length - 1;