# HG changeset patch
# User deba
# Date 1151509125 0
# Node ID 48ec8161f9e1d5e3dcf0ce8ae49054090dea0c31
# Parent  f27dfd29c5c0b1b0bd01bbf04b0afe9a6eef552e
Some modification in the documentation.

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