Changeset 812:4b1b378823dc in lemon1.2 for lemon/capacity_scaling.h
 Timestamp:
 11/12/09 23:49:05 (10 years ago)
 Branch:
 default
 Phase:
 public
 Rebase:
 30323866356537663935353430623930626534653939636630353730643832346265623131623731
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/capacity_scaling.h
r811 r812 36 36 /// Default traits class of CapacityScaling algorithm. 37 37 /// \tparam GR Digraph type. 38 /// \tparam V The valuetype used for flow amounts, capacity bounds38 /// \tparam V The number type used for flow amounts, capacity bounds 39 39 /// and supply values. By default it is \c int. 40 /// \tparam C The valuetype used for costs and potentials.40 /// \tparam C The number type used for costs and potentials. 41 41 /// By default it is the same as \c V. 42 42 template <typename GR, typename V = int, typename C = V> … … 76 76 /// 77 77 /// \tparam GR The digraph type the algorithm runs on. 78 /// \tparam V The valuetype used for flow amounts, capacity bounds78 /// \tparam V The number type used for flow amounts, capacity bounds 79 79 /// and supply values in the algorithm. By default it is \c int. 80 /// \tparam C The valuetype used for costs and potentials in the80 /// \tparam C The number type used for costs and potentials in the 81 81 /// algorithm. By default it is the same as \c V. 82 82 /// 83 /// \warning Both valuetypes must be signed and all input data must83 /// \warning Both number types must be signed and all input data must 84 84 /// be integer. 85 85 /// \warning This algorithm does not support negative costs for such … … 123 123 /// The digraph contains an arc of negative cost and infinite 124 124 /// upper bound. It means that the objective function is unbounded 125 /// on that arc, however note that it could actually be bounded125 /// on that arc, however, note that it could actually be bounded 126 126 /// over the feasible flows, but this algroithm cannot handle 127 127 /// these cases. … … 308 308 std::numeric_limits<Value>::max()) 309 309 { 310 // Check the valuetypes310 // Check the number types 311 311 LEMON_ASSERT(std::numeric_limits<Value>::is_signed, 312 312 "The flow type of CapacityScaling must be signed"); … … 412 412 /// If it is not used before calling \ref run(), the upper bounds 413 413 /// will be set to \ref INF on all arcs (i.e. the flow value will be 414 /// unbounded from above on each arc).414 /// unbounded from above). 415 415 /// 416 416 /// \param map An arc map storing the upper bounds. … … 515 515 /// \ref reset() is called, thus only the modified parameters 516 516 /// have to be set again. See \ref reset() for examples. 517 /// However the underlying digraph must not be modified after this517 /// However, the underlying digraph must not be modified after this 518 518 /// class have been constructed, since it copies and extends the graph. 519 519 /// … … 528 528 /// \n \c UNBOUNDED if the digraph contains an arc of negative cost 529 529 /// and infinite upper bound. It means that the objective function 530 /// is unbounded on that arc, however note that it could actually be530 /// is unbounded on that arc, however, note that it could actually be 531 531 /// bounded over the feasible flows, but this algroithm cannot handle 532 532 /// these cases.
Note: See TracChangeset
for help on using the changeset viewer.