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