Changeset 919:e0cef67fe565 in lemonmain for lemon/cost_scaling.h
 Timestamp:
 01/09/11 16:51:14 (9 years ago)
 Branch:
 default
 Phase:
 public
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/cost_scaling.h
r877 r919 98 98 /// "preflow pushrelabel" algorithm for the maximum flow problem. 99 99 /// 100 /// In general, \ref NetworkSimplex and \ref CostScaling are the fastest 101 /// implementations available in LEMON for this problem. 102 /// 100 103 /// Most of the parameters of the problem (except for the digraph) 101 104 /// can be given using separate functions, and the algorithm can be … … 116 119 /// \warning Both number types must be signed and all input data must 117 120 /// be integer. 118 /// \warning This algorithm does not support negative costs for such119 /// arcs that haveinfinite upper bound.121 /// \warning This algorithm does not support negative costs for 122 /// arcs having infinite upper bound. 120 123 /// 121 124 /// \note %CostScaling provides three different internal methods, … … 179 182 /// relabel operation. 180 183 /// By default, the so called \ref PARTIAL_AUGMENT 181 /// "Partial AugmentRelabel" method is used, which provedto be184 /// "Partial AugmentRelabel" method is used, which turned out to be 182 185 /// the most efficient and the most robust on various test inputs. 183 186 /// However, the other methods can be selected using the \ref run() … … 448 451 /// 449 452 /// Using this function has the same effect as using \ref supplyMap() 450 /// with sucha map in which \c k is assigned to \c s, \c k is453 /// with a map in which \c k is assigned to \c s, \c k is 451 454 /// assigned to \c t and all other nodes have zero supply value. 452 455 ///
Note: See TracChangeset
for help on using the changeset viewer.