1.1 --- a/src/lemon/suurballe.h Mon Nov 22 17:49:07 2004 +0000
1.2 +++ b/src/lemon/suurballe.h Mon Nov 22 17:50:26 2004 +0000
1.3 @@ -45,7 +45,7 @@
1.4 ///\param LengthMap The type of the length map (values should be nonnegative).
1.5 ///
1.6 ///\note It it questionable whether it is correct to call this method after
1.7 - ///%Suurballe for it is just a special case of Edmond's and Karp's algorithm
1.8 + ///%Suurballe for it is just a special case of Edmonds' and Karp's algorithm
1.9 ///for finding minimum cost flows. In fact, this implementation just
1.10 ///wraps the MinCostFlow algorithms. The paper of both %Suurballe and
1.11 ///Edmonds-Karp published in 1972, therefore it is possibly right to