1.1 --- a/doc/groups.dox	Fri Aug 09 11:28:17 2013 +0200
     1.2 +++ b/doc/groups.dox	Fri Aug 09 11:29:40 2013 +0200
     1.3 @@ -422,7 +422,8 @@
     1.4  nodes or above), especially if they are sparse.
     1.5  However, other algorithms could be faster in special cases.
     1.6  For example, if the total supply and/or capacities are rather small,
     1.7 -\ref CapacityScaling is usually the fastest algorithm (without effective scaling).
     1.8 +\ref CapacityScaling is usually the fastest algorithm
     1.9 +(without effective scaling).
    1.10  
    1.11  These classes are intended to be used with integer-valued input data
    1.12  (capacities, supply values, and costs), except for \ref CapacityScaling,