1.1 --- a/src/hugo/mincostflows.h	Tue Sep 21 11:54:20 2004 +0000
     1.2 +++ b/src/hugo/mincostflows.h	Tue Sep 21 21:10:26 2004 +0000
     1.3 @@ -23,15 +23,18 @@
     1.4    ///
     1.5    /// The class \ref hugo::MinCostFlows "MinCostFlows" implements
     1.6    /// an algorithm for finding a flow of value \c k 
     1.7 -  /// having minimal total cost  
     1.8 +  /// having minimal total cost 
     1.9    /// from a given source node to a given target node in an
    1.10 -  /// edge-weighted directed graph having nonnegative integer capacities.
    1.11 -  /// The range of the length (weight or cost) function can be nonnegative reals but 
    1.12 -  /// the range of the capacity function has to be the set of nonnegative integers.
    1.13 -  /// This algorithm is intended to use only for for small values of \c k, since  /// it is not a polinomial time algorithm for finding the minimum cost
    1.14 -  /// maximal flow (in order to find the minimum cost flow of value \c k it 
    1.15 +  /// edge-weighted directed graph. To this end, 
    1.16 +  /// the edge-capacities and edge-weitghs have to be nonnegative. 
    1.17 +  /// The edge-capacities should be integers, but the edge-weights can be 
    1.18 +  /// integers, reals or of other comparable numeric type.
    1.19 +  /// This algorithm is intended to use only for small values of \c k, 
    1.20 +  /// since it is only polynomial in k, 
    1.21 +  /// not in the length of k (which is log k). 
    1.22 +  /// In order to find the minimum cost flow of value \c k it 
    1.23    /// finds the minimum cost flow of value \c i for every 
    1.24 -  /// \c i between 0 and \c k). 
    1.25 +  /// \c i between 0 and \c k. 
    1.26    ///
    1.27    ///\param Graph The directed graph type the algorithm runs on.
    1.28    ///\param LengthMap The type of the length map.
    1.29 @@ -41,8 +44,6 @@
    1.30    template <typename Graph, typename LengthMap, typename CapacityMap>
    1.31    class MinCostFlows {
    1.32  
    1.33 -
    1.34 -
    1.35      typedef typename LengthMap::ValueType Length;
    1.36  
    1.37      //Warning: this should be integer type