diff -r 6563019430ba -r 1a7593db0eaa src/lemon/suurballe.h
--- a/src/lemon/suurballe.h	Mon Nov 08 15:22:39 2004 +0000
+++ b/src/lemon/suurballe.h	Mon Nov 08 15:23:31 2004 +0000
@@ -44,9 +44,9 @@
   ///\param Graph The directed graph type the algorithm runs on.
   ///\param LengthMap The type of the length map (values should be nonnegative).
   ///
-  ///\note It it questionable if it is correct to call this method after
+  ///\note It it questionable whether it is correct to call this method after
   ///%Suurballe for it is just a special case of Edmond's and Karp's algorithm
-  ///for finding minimum cost flows. In fact, this implementation is just
+  ///for finding minimum cost flows. In fact, this implementation just
   ///wraps the MinCostFlow algorithms. The paper of both %Suurballe and
   ///Edmonds-Karp published in 1972, therefore it is possibly right to
   ///state that they are