AUTHORS
author Peter Kovacs <kpeter@inf.elte.hu>
Thu, 12 Nov 2009 23:26:13 +0100
changeset 872 fa6f37d7a25b
child 1072 3dcb45a871c3
permissions -rw-r--r--
Entirely rework CapacityScaling (#180)

- Use the new interface similarly to NetworkSimplex.
- Rework the implementation using an efficient internal structure
for handling the residual network. This improvement made the
code much faster (up to 2-5 times faster on large graphs).
- Handle GEQ supply type (LEQ is not supported).
- Handle negative costs for arcs of finite capacity.
(Note that this algorithm cannot handle arcs of negative cost
and infinite upper bound, thus it returns UNBOUNDED if such
an arc exists.)
- Extend the documentation.
     1 The authors of the 1.x series are
     2 
     3  * Balazs Dezso <deba@inf.elte.hu>
     4  * Alpar Juttner <alpar@cs.elte.hu>
     5  * Peter Kovacs <kpeter@inf.elte.hu>
     6  * Akos Ladanyi <ladanyi@tmit.bme.hu>
     7 
     8 For more details on the actual contribution, please visit the history
     9 of the main LEMON source repository: http://lemon.cs.elte.hu/hg/lemon
    10 
    11 Moreover, this version is heavily based on the 0.x series of
    12 LEMON. Here is the list of people who contributed to those versions.
    13 
    14  * Mihaly Barasz <klao@cs.elte.hu>
    15  * Johanna Becker <beckerjc@cs.elte.hu>
    16  * Attila Bernath <athos@cs.elte.hu>
    17  * Balazs Dezso <deba@inf.elte.hu>
    18  * Peter Hegyi <hegyi@tmit.bme.hu>
    19  * Alpar Juttner <alpar@cs.elte.hu>
    20  * Peter Kovacs <kpeter@inf.elte.hu>
    21  * Akos Ladanyi <ladanyi@tmit.bme.hu>
    22  * Marton Makai <marci@cs.elte.hu>
    23  * Jacint Szabo <jacint@cs.elte.hu>
    24 
    25 Again, please visit the history of the old LEMON repository for more
    26 details: http://lemon.cs.elte.hu/svn/lemon/trunk