Peter Kovacs <kpeter@inf.elte.hu> [Fri, 13 Nov 2009 00:23:07 +0100] rev 818
 
Rework the MCF test file to help extending it (#180)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 13 Nov 2009 00:15:50 +0100] rev 817
 
Fixes in the heap concept to avoid warnings (#180)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 13 Nov 2009 00:11:11 +0100] rev 816
 
Add citations to CycleCanceling (#180, #184)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 13 Nov 2009 00:10:33 +0100] rev 815
 
Entirely rework cycle canceling algorithms (#180)
  - Move the cycle canceling algorithms (CycleCanceling, CancelAndTighten)
    into one class (CycleCanceling).
  - Add a Method parameter to the run() function to be able to select
    the used cycle canceling method.
  - Use the new interface similarly to NetworkSimplex.
  - Rework the implementations using an efficient internal structure
    for handling the residual network.
    This improvement made the codes much faster.
  - Handle GEQ supply type (LEQ is not supported).
  - Handle infinite upper bounds.
  - Handle negative costs (for arcs of finite upper bound).
  - Extend the documentation.