COIN-OR::LEMON - Graph Library

Ignore:
File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/preflow.h

    r762 r760  
    105105  /// "flow of maximum value" in a digraph.
    106106  /// The preflow algorithms are the fastest known maximum
    107   /// flow algorithms. The current implementation uses a mixture of the
     107  /// flow algorithms. The current implementation use a mixture of the
    108108  /// \e "highest label" and the \e "bound decrease" heuristics.
    109109  /// The worst case time complexity of the algorithm is \f$O(n^2\sqrt{e})\f$.
     
    379379    }
    380380
    381     /// \brief Sets the tolerance used by the algorithm.
    382     ///
    383     /// Sets the tolerance object used by the algorithm.
    384     /// \return <tt>(*this)</tt>
    385     Preflow& tolerance(const Tolerance& tolerance) {
     381    /// \brief Sets the tolerance used by algorithm.
     382    ///
     383    /// Sets the tolerance used by algorithm.
     384    Preflow& tolerance(const Tolerance& tolerance) const {
    386385      _tolerance = tolerance;
    387386      return *this;
     
    390389    /// \brief Returns a const reference to the tolerance.
    391390    ///
    392     /// Returns a const reference to the tolerance object used by
    393     /// the algorithm.
     391    /// Returns a const reference to the tolerance.
    394392    const Tolerance& tolerance() const {
    395       return _tolerance;
     393      return tolerance;
    396394    }
    397395
Note: See TracChangeset for help on using the changeset viewer.