# Changeset 893:89d5c283a485 in lemon-0.x

Ignore:
Timestamp:
09/21/04 23:10:26 (17 years ago)
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1201
Message:

Dox readable more even.

File:
1 edited

Unmodified
Added
Removed
• ## src/hugo/mincostflows.h

 r860 /// The class \ref hugo::MinCostFlows "MinCostFlows" implements /// an algorithm for finding a flow of value \c k /// having minimal total cost /// having minimal total cost /// from a given source node to a given target node in an /// edge-weighted directed graph having nonnegative integer capacities. /// The range of the length (weight or cost) function can be nonnegative reals but /// the range of the capacity function has to be the set of nonnegative integers. /// 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 /// maximal flow (in order to find the minimum cost flow of value \c k it /// edge-weighted directed graph. To this end, /// the edge-capacities and edge-weitghs have to be nonnegative. /// The edge-capacities should be integers, but the edge-weights can be /// integers, reals or of other comparable numeric type. /// This algorithm is intended to use only for small values of \c k, /// since it is only polynomial in k, /// not in the length of k (which is log k). /// In order to find the minimum cost flow of value \c k it /// finds the minimum cost flow of value \c i for every /// \c i between 0 and \c k). /// \c i between 0 and \c k. /// ///\param Graph The directed graph type the algorithm runs on. template class MinCostFlows { typedef typename LengthMap::ValueType Length;
Note: See TracChangeset for help on using the changeset viewer.