COIN-OR::LEMON - Graph Library

Changeset 922:9312d6c89d02 in lemon-main for lemon/cost_scaling.h


Ignore:
Timestamp:
01/10/11 09:34:50 (9 years ago)
Author:
Alpar Juttner <alpar@…>
Branch:
default
Parents:
921:140c953ad5d1 (diff), 920: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

Legend:

Unmodified
Added
Removed
  • lemon/cost_scaling.h

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

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