1.1 --- a/lemon/cost_scaling.h	Sat Jan 08 15:52:07 2011 +0100
     1.2 +++ b/lemon/cost_scaling.h	Sun Jan 09 16:51:14 2011 +0100
     1.3 @@ -97,6 +97,9 @@
     1.4    /// can be viewed as the generalization of the \ref Preflow
     1.5    /// "preflow push-relabel" algorithm for the maximum flow problem.
     1.6    ///
     1.7 +  /// In general, \ref NetworkSimplex and \ref CostScaling are the fastest
     1.8 +  /// implementations available in LEMON for this problem.
     1.9 +  ///
    1.10    /// Most of the parameters of the problem (except for the digraph)
    1.11    /// can be given using separate functions, and the algorithm can be
    1.12    /// executed using the \ref run() function. If some parameters are not
    1.13 @@ -115,8 +118,8 @@
    1.14    ///
    1.15    /// \warning Both number types must be signed and all input data must
    1.16    /// be integer.
    1.17 -  /// \warning This algorithm does not support negative costs for such
    1.18 -  /// arcs that have infinite upper bound.
    1.19 +  /// \warning This algorithm does not support negative costs for
    1.20 +  /// arcs having infinite upper bound.
    1.21    ///
    1.22    /// \note %CostScaling provides three different internal methods,
    1.23    /// from which the most efficient one is used by default.
    1.24 @@ -178,7 +181,7 @@
    1.25      /// in their base operations, which are used in conjunction with the
    1.26      /// relabel operation.
    1.27      /// By default, the so called \ref PARTIAL_AUGMENT
    1.28 -    /// "Partial Augment-Relabel" method is used, which proved to be
    1.29 +    /// "Partial Augment-Relabel" method is used, which turned out to be
    1.30      /// the most efficient and the most robust on various test inputs.
    1.31      /// However, the other methods can be selected using the \ref run()
    1.32      /// function with the proper parameter.
    1.33 @@ -447,7 +450,7 @@
    1.34      /// calling \ref run(), the supply of each node will be set to zero.
    1.35      ///
    1.36      /// Using this function has the same effect as using \ref supplyMap()
    1.37 -    /// with such a map in which \c k is assigned to \c s, \c -k is
    1.38 +    /// with a map in which \c k is assigned to \c s, \c -k is
    1.39      /// assigned to \c t and all other nodes have zero supply value.
    1.40      ///
    1.41      /// \param s The source node.