# Changeset 1026:9312d6c89d02 in lemon for lemon/cost_scaling.h

Ignore:
Timestamp:
01/10/11 09:34:50 (12 years ago)
Branch:
default
Parents:
1025:140c953ad5d1 (diff), 1024:745312f9b441 (diff)
Note: this is a merge changeset, the changes displayed below correspond to the merge itself.
Use the (diff) links above to see all the changes relative to each parent.
Phase:
public
Message:

Merge

Files:
2 edited

Unmodified
Added
Removed
• ## lemon/cost_scaling.h

 r1023 /// consider to use the named template parameters instead. /// /// \warning Both number types must be signed and all input data must /// \warning Both \c V and \c C must be signed number types. /// \warning All input data (capacities, supply values, and costs) must /// be integer. /// \warning This algorithm does not support negative costs for
• ## lemon/cost_scaling.h

 r1025 /// "preflow push-relabel" algorithm for the maximum flow problem. /// /// In general, \ref NetworkSimplex and \ref CostScaling are the fastest /// implementations available in LEMON for this problem. /// /// Most of the parameters of the problem (except for the digraph) /// can be given using separate functions, and the algorithm can be /// \warning All input data (capacities, supply values, and costs) must /// be integer. /// \warning This algorithm does not support negative costs for such /// arcs that have infinite upper bound. /// \warning This algorithm does not support negative costs for /// arcs having infinite upper bound. /// /// \note %CostScaling provides three different internal methods, /// relabel operation. /// By default, the so called \ref PARTIAL_AUGMENT /// "Partial Augment-Relabel" method is used, which proved to be /// "Partial Augment-Relabel" method is used, which turned out to be /// the most efficient and the most robust on various test inputs. /// However, the other methods can be selected using the \ref run() /// /// Using this function has the same effect as using \ref supplyMap() /// with such a map in which \c k is assigned to \c s, \c -k is /// with a map in which \c k is assigned to \c s, \c -k is /// assigned to \c t and all other nodes have zero supply value. ///
Note: See TracChangeset for help on using the changeset viewer.