Changeset 878:4b1b378823dc in lemon for lemon/cost_scaling.h
 Timestamp:
 11/12/09 23:49:05 (13 years ago)
 Branch:
 default
 Phase:
 public
 Rebase:
 30323866356537663935353430623930626534653939636630353730643832346265623131623731
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/cost_scaling.h
r876 r878 41 41 /// Default traits class of CostScaling algorithm. 42 42 /// \tparam GR Digraph type. 43 /// \tparam V The valuetype used for flow amounts, capacity bounds43 /// \tparam V The number type used for flow amounts, capacity bounds 44 44 /// and supply values. By default it is \c int. 45 /// \tparam C The valuetype used for costs and potentials.45 /// \tparam C The number type used for costs and potentials. 46 46 /// By default it is the same as \c V. 47 47 #ifdef DOXYGEN … … 102 102 /// 103 103 /// \tparam GR The digraph type the algorithm runs on. 104 /// \tparam V The valuetype used for flow amounts, capacity bounds104 /// \tparam V The number type used for flow amounts, capacity bounds 105 105 /// and supply values in the algorithm. By default it is \c int. 106 /// \tparam C The valuetype used for costs and potentials in the106 /// \tparam C The number type used for costs and potentials in the 107 107 /// algorithm. By default it is the same as \c V. 108 108 /// 109 /// \warning Both valuetypes must be signed and all input data must109 /// \warning Both number types must be signed and all input data must 110 110 /// be integer. 111 111 /// \warning This algorithm does not support negative costs for such … … 158 158 /// The digraph contains an arc of negative cost and infinite 159 159 /// upper bound. It means that the objective function is unbounded 160 /// on that arc, however note that it could actually be bounded160 /// on that arc, however, note that it could actually be bounded 161 161 /// over the feasible flows, but this algroithm cannot handle 162 162 /// these cases. … … 326 326 std::numeric_limits<Value>::max()) 327 327 { 328 // Check the valuetypes328 // Check the number types 329 329 LEMON_ASSERT(std::numeric_limits<Value>::is_signed, 330 330 "The flow type of CostScaling must be signed"); … … 434 434 /// If it is not used before calling \ref run(), the upper bounds 435 435 /// will be set to \ref INF on all arcs (i.e. the flow value will be 436 /// unbounded from above on each arc).436 /// unbounded from above). 437 437 /// 438 438 /// \param map An arc map storing the upper bounds. … … 550 550 /// \n \c UNBOUNDED if the digraph contains an arc of negative cost 551 551 /// and infinite upper bound. It means that the objective function 552 /// is unbounded on that arc, however note that it could actually be552 /// is unbounded on that arc, however, note that it could actually be 553 553 /// bounded over the feasible flows, but this algroithm cannot handle 554 554 /// these cases. … … 572 572 /// used, all the parameters given before are kept for the next 573 573 /// \ref run() call. 574 /// However the underlying digraph must not be modified after this574 /// However, the underlying digraph must not be modified after this 575 575 /// class have been constructed, since it copies and extends the graph. 576 576 ///
Note: See TracChangeset
for help on using the changeset viewer.