RhodeCode

  public:

    /// \name Execution control

    /// The simplest way to execute the algorithm is to use

    /// one of the member functions called \c run(...).

    /// \n

    /// If you need more control on the execution,

    /// first you must call \ref init(), then the \ref calculateIn() or

    /// @{

    /// \brief Initializes the internal data structures.

    ///

    /// Initializes the internal data structures. It creates

    /// the maps, residual graph adaptors and some bucket structures

    /// for the algorithm.

      _min_cut = std::numeric_limits<Value>::max();

    }

    /// \brief Calculates a minimum cut with \f$ source \f$ on the

    /// source-side.

    ///

    /// Calculates a minimum cut with \f$ source \f$ on the

    void calculateOut() {

      findMinCutOut();

    }

    /// \brief Calculates a minimum cut with \f$ source \f$ on the

    /// target-side.

    ///

    /// Calculates a minimum cut with \f$ source \f$ on the

    void calculateIn() {

      findMinCutIn();

    }

    /// \brief Runs the algorithm.

    ///

    /// Runs the algorithm. It finds nodes \c source and \c target