lemon/preflow.h
 changeset 736 86c49553fea5 parent 735 1f08e846df29 child 762 ece80147fb08
     1.1 --- a/lemon/preflow.h	Tue Aug 18 10:24:31 2009 +0200
1.2 +++ b/lemon/preflow.h	Tue Aug 18 10:35:35 2009 +0200
1.3 @@ -97,7 +97,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 @@ -371,9 +371,10 @@
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 +    /// Sets the tolerance object used by the algorithm.
1.21 +    /// \return <tt>(*this)</tt>
1.22      Preflow& tolerance(const Tolerance& tolerance) {
1.23        _tolerance = tolerance;
1.24        return *this;
1.25 @@ -381,7 +382,8 @@
1.26
1.27      /// \brief Returns a const reference to the tolerance.
1.28      ///
1.29 -    /// Returns a const reference to the tolerance.
1.30 +    /// Returns a const reference to the tolerance object used by
1.31 +    /// the algorithm.
1.32      const Tolerance& tolerance() const {
1.33        return _tolerance;
1.34      }