1.1 --- a/lemon/preflow.h	Fri Jul 24 11:07:52 2009 +0200
     1.2 +++ b/lemon/preflow.h	Fri Sep 25 09:06:32 2009 +0200
     1.3 @@ -104,7 +104,7 @@
     1.4    /// \e push-relabel algorithm producing a \ref max_flow
     1.5    /// "flow of maximum value" in a digraph.
     1.6    /// The preflow algorithms are the fastest known maximum
     1.7 -  /// flow algorithms. The current implementation use a mixture of the
     1.8 +  /// flow algorithms. The current implementation uses a mixture of the
     1.9    /// \e "highest label" and the \e "bound decrease" heuristics.
    1.10    /// The worst case time complexity of the algorithm is \f$O(n^2\sqrt{e})\f$.
    1.11    ///
    1.12 @@ -378,19 +378,21 @@
    1.13        return *_level;
    1.14      }
    1.15  
    1.16 -    /// \brief Sets the tolerance used by algorithm.
    1.17 +    /// \brief Sets the tolerance used by the algorithm.
    1.18      ///
    1.19 -    /// Sets the tolerance used by algorithm.
    1.20 -    Preflow& tolerance(const Tolerance& tolerance) const {
    1.21 +    /// Sets the tolerance object used by the algorithm.
    1.22 +    /// \return <tt>(*this)</tt>
    1.23 +    Preflow& tolerance(const Tolerance& tolerance) {
    1.24        _tolerance = tolerance;
    1.25        return *this;
    1.26      }
    1.27  
    1.28      /// \brief Returns a const reference to the tolerance.
    1.29      ///
    1.30 -    /// Returns a const reference to the tolerance.
    1.31 +    /// Returns a const reference to the tolerance object used by
    1.32 +    /// the algorithm.
    1.33      const Tolerance& tolerance() const {
    1.34 -      return tolerance;
    1.35 +      return _tolerance;
    1.36      }
    1.37  
    1.38      /// \name Execution Control