COIN-OR::LEMON - Graph Library

Changeset 815:aef153f430e1 in lemon-1.2 for lemon/Makefile.am


Ignore:
Timestamp:
11/13/09 00:10:33 (14 years ago)
Author:
Peter Kovacs <kpeter@…>
Branch:
default
Phase:
public
Rebase:
62373361373236626665663832376334666366353631373365333236323466343130303133633939
Message:

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.
File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/Makefile.am

    r814 r815  
    6363        lemon/binom_heap.h \
    6464        lemon/bucket_heap.h \
    65         lemon/cancel_and_tighten.h \
    6665        lemon/capacity_scaling.h \
    6766        lemon/cbc.h \
Note: See TracChangeset for help on using the changeset viewer.