COIN-OR::LEMON - Graph Library

Ignore:
Timestamp:
01/09/11 16:51:14 (9 years ago)
Author:
Peter Kovacs <kpeter@…>
Branch:
default
Phase:
public
Message:

Various doc improvements (#406)

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/cycle_canceling.h

    r956 r1023  
    6868  /// \warning Both number types must be signed and all input data must
    6969  /// be integer.
    70   /// \warning This algorithm does not support negative costs for such
    71   /// arcs that have infinite upper bound.
     70  /// \warning This algorithm does not support negative costs for
     71  /// arcs having infinite upper bound.
    7272  ///
    7373  /// \note For more information about the three available methods,
     
    117117    /// \ref CycleCanceling provides three different cycle-canceling
    118118    /// methods. By default, \ref CANCEL_AND_TIGHTEN "Cancel and Tighten"
    119     /// is used, which proved to be the most efficient and the most robust
    120     /// on various test inputs.
     119    /// is used, which is by far the most efficient and the most robust.
    121120    /// However, the other methods can be selected using the \ref run()
    122121    /// function with the proper parameter.
     
    350349    ///
    351350    /// Using this function has the same effect as using \ref supplyMap()
    352     /// with such a map in which \c k is assigned to \c s, \c -k is
     351    /// with a map in which \c k is assigned to \c s, \c -k is
    353352    /// assigned to \c t and all other nodes have zero supply value.
    354353    ///
Note: See TracChangeset for help on using the changeset viewer.