[Lemon-commits] [lemon_svn] deba: r2819 - hugo/trunk/lemon

[Lemon SVN]

Author: deba
Date: Wed Jun 28 17:38:45 2006
New Revision: 2819

Modified:
   hugo/trunk/lemon/edmonds_karp.h

Log:
Some modification in the documentation.



Modified: hugo/trunk/lemon/edmonds_karp.h
==============================================================================
--- hugo/trunk/lemon/edmonds_karp.h	(original)
+++ hugo/trunk/lemon/edmonds_karp.h	Wed Jun 28 17:38:45 2006
@@ -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.