# HG changeset patch
# User alpar
# Date 1101145826 0
# Node ID f42cb3146ed450b2c7592778497537b5dd2abba2
# Parent  ee01de62188daaca762d5f2907c3284832a92643
Fix Edmonds' name.

diff -r ee01de62188d -r f42cb3146ed4 src/lemon/suurballe.h
--- a/src/lemon/suurballe.h	Mon Nov 22 17:49:07 2004 +0000
+++ b/src/lemon/suurballe.h	Mon Nov 22 17:50:26 2004 +0000
@@ -45,7 +45,7 @@
   ///\param LengthMap The type of the length map (values should be nonnegative).
   ///
   ///\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
+  ///%Suurballe for it is just a special case of Edmonds' and Karp's algorithm
   ///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