Changeset 1527:7ceab500e1f6 in lemon0.x for lemon/min_cost_flow.h
 Timestamp:
 07/01/05 12:33:27 (15 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@2014
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/min_cost_flow.h
r1435 r1527 39 39 /// The class \ref lemon::MinCostFlow "MinCostFlow" implements an 40 40 /// algorithm for finding a flow of value \c k having minimal total 41 /// cost from a given source node to a given target node in a n42 /// edgeweighted directed graph. To this end, the edgecapacities43 /// and edgeweights have to be nonnegative. The edgecapacities44 /// should be integers, but the edgeweights can be integers, reals45 /// or of other comparable numeric type. This algorithm is intended46 /// to be used only for small values of \c k, since it is only47 /// polynomial in k, not in the length of k (which is log k):in48 /// order to find the minimum cost flow of value \c k it finds the49 /// minimum cost flow of value \c i for every \c i between 0 and \c50 /// k.41 /// cost from a given source node to a given target node in a 42 /// directed graph with a cost function on the edges. To 43 /// this end, the edgecapacities and edgecosts have to be 44 /// nonnegative. The edgecapacities should be integers, but the 45 /// edgecosts can be integers, reals or of other comparable 46 /// numeric type. This algorithm is intended to be used only for 47 /// small values of \c k, since it is only polynomial in k, not in 48 /// the length of k (which is log k): in order to find the minimum 49 /// cost flow of value \c k it finds the minimum cost flow of value 50 /// \c i for every \c i between 0 and \c k. 51 51 /// 52 52 ///\param Graph The directed graph type the algorithm runs on. … … 118 118 119 119 \param _g The directed graph the algorithm runs on. 120 \param _length The length ( weight orcost) of the edges.120 \param _length The length (cost) of the edges. 121 121 \param _cap The capacity of the edges. 122 122 \param _s Source node. … … 204 204 } 205 205 206 /// Total weight of the found flow.207 208 /// This function gives back the total weight of the found flow.206 /// Total cost of the found flow. 207 208 /// This function gives back the total cost of the found flow. 209 209 Length totalLength(){ 210 210 return total_length;
Note: See TracChangeset
for help on using the changeset viewer.