COIN-OR::LEMON - Graph Library

Ignore:
File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/cycle_canceling.h

    r1025 r1026  
    6969  /// \warning All input data (capacities, supply values, and costs) must
    7070  /// be integer.
    71   /// \warning This algorithm does not support negative costs for such
    72   /// arcs that have infinite upper bound.
     71  /// \warning This algorithm does not support negative costs for
     72  /// arcs having infinite upper bound.
    7373  ///
    7474  /// \note For more information about the three available methods,
     
    118118    /// \ref CycleCanceling provides three different cycle-canceling
    119119    /// methods. By default, \ref CANCEL_AND_TIGHTEN "Cancel and Tighten"
    120     /// is used, which proved to be the most efficient and the most robust
    121     /// on various test inputs.
     120    /// is used, which is by far the most efficient and the most robust.
    122121    /// However, the other methods can be selected using the \ref run()
    123122    /// function with the proper parameter.
     
    351350    ///
    352351    /// Using this function has the same effect as using \ref supplyMap()
    353     /// with such a map in which \c k is assigned to \c s, \c -k is
     352    /// with a map in which \c k is assigned to \c s, \c -k is
    354353    /// assigned to \c t and all other nodes have zero supply value.
    355354    ///
Note: See TracChangeset for help on using the changeset viewer.