1.1 --- a/lemon/min_cost_flow.h	Thu Jun 30 16:13:30 2005 +0000
     1.2 +++ b/lemon/min_cost_flow.h	Fri Jul 01 10:33:27 2005 +0000
     1.3 @@ -38,16 +38,16 @@
     1.4    ///
     1.5    /// The class \ref lemon::MinCostFlow "MinCostFlow" implements an
     1.6    /// algorithm for finding a flow of value \c k having minimal total
     1.7 -  /// cost from a given source node to a given target node in an
     1.8 -  /// edge-weighted directed graph. To this end, the edge-capacities
     1.9 -  /// and edge-weights have to be nonnegative.  The edge-capacities
    1.10 -  /// should be integers, but the edge-weights can be integers, reals
    1.11 -  /// or of other comparable numeric type.  This algorithm is intended
    1.12 -  /// to be used only for small values of \c k, since it is only
    1.13 -  /// polynomial in k, not in the length of k (which is log k):  in
    1.14 -  /// order to find the minimum cost flow of value \c k it finds the
    1.15 -  /// minimum cost flow of value \c i for every \c i between 0 and \c
    1.16 -  /// k.
    1.17 +  /// cost from a given source node to a given target node in a
    1.18 +  /// directed graph with a cost function on the edges. To
    1.19 +  /// this end, the edge-capacities and edge-costs have to be
    1.20 +  /// nonnegative.  The edge-capacities should be integers, but the
    1.21 +  /// edge-costs can be integers, reals or of other comparable
    1.22 +  /// numeric type.  This algorithm is intended to be used only for
    1.23 +  /// small values of \c k, since it is only polynomial in k, not in
    1.24 +  /// the length of k (which is log k): in order to find the minimum
    1.25 +  /// cost flow of value \c k it finds the minimum cost flow of value
    1.26 +  /// \c i for every \c i between 0 and \c k.
    1.27    ///
    1.28    ///\param Graph The directed graph type the algorithm runs on.
    1.29    ///\param LengthMap The type of the length map.
    1.30 @@ -117,7 +117,7 @@
    1.31      /*! \brief The constructor of the class.
    1.32      
    1.33      \param _g The directed graph the algorithm runs on. 
    1.34 -    \param _length The length (weight or cost) of the edges. 
    1.35 +    \param _length The length (cost) of the edges. 
    1.36      \param _cap The capacity of the edges. 
    1.37      \param _s Source node.
    1.38      \param _t Target node.
    1.39 @@ -203,9 +203,9 @@
    1.40        return i;
    1.41      }
    1.42  
    1.43 -    /// Total weight of the found flow.
    1.44 +    /// Total cost of the found flow.
    1.45  
    1.46 -    /// This function gives back the total weight of the found flow.
    1.47 +    /// This function gives back the total cost of the found flow.
    1.48      Length totalLength(){
    1.49        return total_length;
    1.50      }