1.1 --- a/lemon/cycle_canceling.h	Sat Jan 08 15:52:07 2011 +0100
     1.2 +++ b/lemon/cycle_canceling.h	Sun Jan 09 16:51:14 2011 +0100
     1.3 @@ -67,8 +67,8 @@
     1.4    ///
     1.5    /// \warning Both number types must be signed and all input data must
     1.6    /// be integer.
     1.7 -  /// \warning This algorithm does not support negative costs for such
     1.8 -  /// arcs that have infinite upper bound.
     1.9 +  /// \warning This algorithm does not support negative costs for
    1.10 +  /// arcs having infinite upper bound.
    1.11    ///
    1.12    /// \note For more information about the three available methods,
    1.13    /// see \ref Method.
    1.14 @@ -116,8 +116,7 @@
    1.15      ///
    1.16      /// \ref CycleCanceling provides three different cycle-canceling
    1.17      /// methods. By default, \ref CANCEL_AND_TIGHTEN "Cancel and Tighten"
    1.18 -    /// is used, which proved to be the most efficient and the most robust
    1.19 -    /// on various test inputs.
    1.20 +    /// is used, which is by far the most efficient and the most robust.
    1.21      /// However, the other methods can be selected using the \ref run()
    1.22      /// function with the proper parameter.
    1.23      enum Method {
    1.24 @@ -349,7 +348,7 @@
    1.25      /// calling \ref run(), the supply of each node will be set to zero.
    1.26      ///
    1.27      /// Using this function has the same effect as using \ref supplyMap()
    1.28 -    /// with such a map in which \c k is assigned to \c s, \c -k is
    1.29 +    /// with a map in which \c k is assigned to \c s, \c -k is
    1.30      /// assigned to \c t and all other nodes have zero supply value.
    1.31      ///
    1.32      /// \param s The source node.