Changes in lemon/cycle_canceling.h [1025:140c953ad5d1:1026:9312d6c89d02] in lemon
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/cycle_canceling.h
r1025 r1026 69 69 /// \warning All input data (capacities, supply values, and costs) must 70 70 /// be integer. 71 /// \warning This algorithm does not support negative costs for such72 /// arcs that haveinfinite upper bound.71 /// \warning This algorithm does not support negative costs for 72 /// arcs having infinite upper bound. 73 73 /// 74 74 /// \note For more information about the three available methods, … … 118 118 /// \ref CycleCanceling provides three different cycle-canceling 119 119 /// 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. 122 121 /// However, the other methods can be selected using the \ref run() 123 122 /// function with the proper parameter. … … 351 350 /// 352 351 /// Using this function has the same effect as using \ref supplyMap() 353 /// with sucha map in which \c k is assigned to \c s, \c -k is352 /// with a map in which \c k is assigned to \c s, \c -k is 354 353 /// assigned to \c t and all other nodes have zero supply value. 355 354 ///
Note: See TracChangeset
for help on using the changeset viewer.