1.1 --- a/lemon/edmonds_karp.h	Wed Jun 28 15:28:38 2006 +0000
     1.2 +++ b/lemon/edmonds_karp.h	Wed Jun 28 15:38:45 2006 +0000
     1.3 @@ -43,8 +43,7 @@
     1.4    ///
     1.5    /// The time complexity of the algorithm is \f$ O(n * e^2) \f$ in
     1.6    /// worst case.  Always try the preflow algorithm instead of this if
     1.7 -  /// you does not have some additional reason than to compute the
     1.8 -  /// optimal flow which has \f$ O(n^3) \f$ time complexity.
     1.9 +  /// you just want to compute the optimal flow.
    1.10    ///
    1.11    /// \param _Graph The directed graph type the algorithm runs on.
    1.12    /// \param _Number The number type of the capacities and the flow values.