Tue, 16 Mar 2010 21:27:35 +0100Merge #314
Alpar Juttner <alpar@cs.elte.hu> [Tue, 16 Mar 2010 21:27:35 +0100] rev 874
Merge #314

Tue, 16 Mar 2010 21:18:39 +0100Minor doc fix related to #348
Alpar Juttner <alpar@cs.elte.hu> [Tue, 16 Mar 2010 21:18:39 +0100] rev 873
Minor doc fix related to #348

Thu, 04 Mar 2010 15:20:59 +0100Uniforming primal scale to 2 (#314)
Balazs Dezso <deba@inf.elte.hu> [Thu, 04 Mar 2010 15:20:59 +0100] rev 872
Uniforming primal scale to 2 (#314)

Thu, 04 Mar 2010 10:17:02 +0100Fix documentation issues (#314)
Balazs Dezso <deba@inf.elte.hu> [Thu, 04 Mar 2010 10:17:02 +0100] rev 871
Fix documentation issues (#314)

Sat, 26 Sep 2009 10:17:31 +0200Fractional matching initialization of weighted matchings (#314)
Balazs Dezso <deba@inf.elte.hu> [Sat, 26 Sep 2009 10:17:31 +0200] rev 870
Fractional matching initialization of weighted matchings (#314)

Fri, 25 Sep 2009 21:51:36 +0200Add fractional matching algorithms (#314)
Balazs Dezso <deba@inf.elte.hu> [Fri, 25 Sep 2009 21:51:36 +0200] rev 869
Add fractional matching algorithms (#314)

Sun, 20 Sep 2009 21:38:24 +0200General improvements in weighted matching algorithms (#314)
Balazs Dezso <deba@inf.elte.hu> [Sun, 20 Sep 2009 21:38:24 +0200] rev 868
General improvements in weighted matching algorithms (#314)

- Fix include guard
- Uniform handling of MATCHED and UNMATCHED blossoms
- Prefer operations which decrease the number of trees
- Fix improper use of '/='

The solved problems did not cause wrong solution.

Tue, 16 Mar 2010 21:12:10 +0100Fix multiple execution bug in weighted matchings (#356)
Balazs Dezso <deba@inf.elte.hu> [Tue, 16 Mar 2010 21:12:10 +0100] rev 867
Fix multiple execution bug in weighted matchings (#356)

This chgset also redoes the fix of [28c7ad6f8d91] and its backpont to 1.1,
[268a052c3043].

Sun, 14 Mar 2010 09:14:05 +0100Add doc/references.dox to .hgignore
Alpar Juttner <alpar@cs.elte.hu> [Sun, 14 Mar 2010 09:14:05 +0100] rev 866
Add doc/references.dox to .hgignore

Sun, 14 Mar 2010 09:13:04 +0100Replace figure at matching doc #348
Alpar Juttner <alpar@cs.elte.hu> [Sun, 14 Mar 2010 09:13:04 +0100] rev 865
Replace figure at matching doc #348

The original bibartite_matching.eps is kept for future use.

Sat, 13 Mar 2010 22:01:38 +0100Rename min mean cycle classes and their members (#179)
Peter Kovacs <kpeter@inf.elte.hu> [Sat, 13 Mar 2010 22:01:38 +0100] rev 864
Rename min mean cycle classes and their members (#179)
with respect to the possible introduction of min ratio
cycle algorithms in the future.

The renamed classes:
- Karp --> KarpMmc
- HartmannOrlin --> HartmannOrlinMmc
- Howard --> HowardMmc

The renamed members:
- cycleLength() --> cycleCost()
- cycleArcNum() --> cycleSize()
- findMinMean() --> findCycleMean()
- Value --> Cost
- LargeValue --> LargeCost
- SetLargeValue --> SetLargeCost

Mon, 08 Mar 2010 08:33:41 +0100Fix gcc 3.3 compilation error (#354)
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 08 Mar 2010 08:33:41 +0100] rev 863
Fix gcc 3.3 compilation error (#354)

gcc 3.3 requires that a class has a default constructor if it has
template named parameters. (That constructor can be protected.)

Thu, 04 Mar 2010 10:03:14 +0100Clarify type names in NetworkSimplex (#353)
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 04 Mar 2010 10:03:14 +0100] rev 862
Clarify type names in NetworkSimplex (#353)

This patch clarifies the misleading effects of the renamings
in [f3bc4e9b5f3a].

Wed, 03 Mar 2010 20:48:29 +0000Merge #306
Alpar Juttner <alpar@cs.elte.hu> [Wed, 03 Mar 2010 20:48:29 +0000] rev 861
Merge #306

Tue, 02 Mar 2010 10:03:07 +0100Add tolerance() functions for HaoOrlin (#306)
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 02 Mar 2010 10:03:07 +0100] rev 860
Add tolerance() functions for HaoOrlin (#306)

Wed, 03 Mar 2010 17:22:13 +0000Merge #301
Alpar Juttner <alpar@cs.elte.hu> [Wed, 03 Mar 2010 17:22:13 +0000] rev 859
Merge #301

Tue, 02 Mar 2010 10:27:47 +0100Also test fullInit() in suurballe_test (#181, #323)
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 02 Mar 2010 10:27:47 +0100] rev 858
Also test fullInit() in suurballe_test (#181, #323)

Fri, 16 Oct 2009 09:35:46 +0200Add traits class + named parameters to Suurballe (#323)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 16 Oct 2009 09:35:46 +0200] rev 857
Add traits class + named parameters to Suurballe (#323)

The following types can be modified using named parameters:
- FlowMap
- PotentialMap
- Path
- Heap + HeapCrossRef

Wed, 03 Mar 2010 17:14:17 +0000Merge #181, #323
Alpar Juttner <alpar@cs.elte.hu> [Wed, 03 Mar 2010 17:14:17 +0000] rev 856
Merge #181, #323

Tue, 29 Sep 2009 13:32:01 +0200Rename heap structures (#301)
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 29 Sep 2009 13:32:01 +0200] rev 855
Rename heap structures (#301)

- KaryHeap --> DHeap
- FouraryHeap --> QuadHeap
- BinomHeap --> BinomialHeap

Fri, 16 Oct 2009 02:32:30 +0200Add a fullInit() function to Suurballe (#181, #323)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 16 Oct 2009 02:32:30 +0200] rev 854
Add a fullInit() function to Suurballe (#181, #323)
to provide faster handling of multiple targets.
A start() function is also added, just for the sake of
convenience.

Fri, 16 Oct 2009 01:06:16 +0200Rework and improve Suurballe (#323)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 16 Oct 2009 01:06:16 +0200] rev 853
Rework and improve Suurballe (#323)

- Improve the implementation: use a specific, faster variant of
residual Dijkstra for the first search.
- Some reorganizatiopn to make the code simpler.
- Small doc improvements.

Thu, 15 Oct 2009 21:04:50 +0200Remove unnecessary integer requirement in Suurballe (#323)
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 15 Oct 2009 21:04:50 +0200] rev 852
Remove unnecessary integer requirement in Suurballe (#323)

Thu, 15 Oct 2009 21:03:17 +0200Bug fix in Suurballe (#323)
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 15 Oct 2009 21:03:17 +0200] rev 851
Bug fix in Suurballe (#323)

Mon, 01 Mar 2010 07:51:45 +0100Configurable glpk prefix in ./scripts/bootstrap.sh and ...
Alpar Juttner <alpar@cs.elte.hu> [Mon, 01 Mar 2010 07:51:45 +0100] rev 850
Configurable glpk prefix in ./scripts/bootstrap.sh and ...
unneeded solver backends are explicitely switched off with --without-*

Sun, 28 Feb 2010 20:52:08 +0100Merge #342
Alpar Juttner <alpar@cs.elte.hu> [Sun, 28 Feb 2010 20:52:08 +0100] rev 849
Merge #342

Sun, 14 Feb 2010 19:06:07 +0100Improve README and mainpage.dox (#342)
Peter Kovacs <kpeter@inf.elte.hu> [Sun, 14 Feb 2010 19:06:07 +0100] rev 848
Improve README and mainpage.dox (#342)

Sun, 28 Feb 2010 19:58:24 +0100Merge #347
Alpar Juttner <alpar@cs.elte.hu> [Sun, 28 Feb 2010 19:58:24 +0100] rev 847
Merge #347

Sat, 20 Feb 2010 16:51:43 +0100Use 'long long' flow cost in dimacs-solver.cc (#347)
Peter Kovacs <kpeter@inf.elte.hu> [Sat, 20 Feb 2010 16:51:43 +0100] rev 846
Use 'long long' flow cost in dimacs-solver.cc (#347)

Sun, 28 Feb 2010 19:38:29 +0100Merge
Alpar Juttner <alpar@cs.elte.hu> [Sun, 28 Feb 2010 19:38:29 +0100] rev 845
Merge

Fri, 19 Feb 2010 14:08:32 +0100Support tolerance technique for BellmanFord (#51)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 19 Feb 2010 14:08:32 +0100] rev 844
Support tolerance technique for BellmanFord (#51)

A new operation traits class BellmanFordToleranceOperationTraits
is introduced, which uses the tolerance technique in its less()
function. This class can be used with the SetOperationTraits
named template parameter.

Sun, 28 Feb 2010 19:23:01 +0100Merge #332
Alpar Juttner <alpar@cs.elte.hu> [Sun, 28 Feb 2010 19:23:01 +0100] rev 843
Merge #332

Sun, 14 Feb 2010 19:23:55 +0100ArgParser can throw exception instead of exit(1) (#332)
Alpar Juttner <alpar@cs.elte.hu> [Sun, 14 Feb 2010 19:23:55 +0100] rev 842
ArgParser can throw exception instead of exit(1) (#332)

Fri, 26 Feb 2010 23:53:09 +0100Better return type for cycleLength() functions (#179)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 26 Feb 2010 23:53:09 +0100] rev 841
Better return type for cycleLength() functions (#179)
in the min mean cycle algorithms.

The original Value type is used instead of the LargeValue type,
which is introduced for internal computations.

Fri, 26 Feb 2010 14:00:20 +0100Merge #340
Alpar Juttner <alpar@cs.elte.hu> [Fri, 26 Feb 2010 14:00:20 +0100] rev 840
Merge #340

Sat, 20 Feb 2010 18:39:03 +0100New heuristics for MCF algorithms (#340)
Peter Kovacs <kpeter@inf.elte.hu> [Sat, 20 Feb 2010 18:39:03 +0100] rev 839
New heuristics for MCF algorithms (#340)
and some implementation improvements.

- A useful heuristic is added to NetworkSimplex to make the
initial pivots faster.
- A powerful global update heuristic is added to CostScaling
and the implementation is reworked with various improvements.
- Better relabeling in CostScaling to improve numerical stability
and make the code faster.
- A small improvement is made in CapacityScaling for better
delta computation.
- Add notes to the classes about the usage of vector<char> instead
of vector<bool> for efficiency reasons.

Sun, 21 Feb 2010 18:55:30 +0100Merge bugfix #336
Alpar Juttner <alpar@cs.elte.hu> [Sun, 21 Feb 2010 18:55:30 +0100] rev 838
Merge bugfix #336

Thu, 11 Feb 2010 10:02:11 +0100Fix the date field comment of graphToEps() output (#336)
Alpar Juttner <alpar@cs.elte.hu> [Thu, 11 Feb 2010 10:02:11 +0100] rev 837
Fix the date field comment of graphToEps() output (#336)

Wed, 17 Feb 2010 23:10:36 +0100Modify the header of scripts/bib2dox.py (#184)
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 17 Feb 2010 23:10:36 +0100] rev 836
Modify the header of scripts/bib2dox.py (#184)

Mon, 15 Feb 2010 09:03:11 +0100Merge
Alpar Juttner <alpar@cs.elte.hu> [Mon, 15 Feb 2010 09:03:11 +0100] rev 835
Merge

Thu, 10 Dec 2009 09:09:08 +0100Fix LpBase::addRow(Constr) (#334)
Balazs Dezso <deba@inf.elte.hu> [Thu, 10 Dec 2009 09:09:08 +0100] rev 834
Fix LpBase::addRow(Constr) (#334)

Sun, 14 Feb 2010 23:14:09 +0100Merge bugfix #337
Balazs Dezso <deba@inf.elte.hu> [Sun, 14 Feb 2010 23:14:09 +0100] rev 833
Merge bugfix #337

Sun, 14 Feb 2010 23:10:24 +0100Use void* like LPX object (#337)
Balazs Dezso <deba@inf.elte.hu> [Sun, 14 Feb 2010 23:10:24 +0100] rev 832
Use void* like LPX object (#337)

Fri, 12 Feb 2010 22:24:26 +0100Merge
Alpar Juttner <alpar@cs.elte.hu> [Fri, 12 Feb 2010 22:24:26 +0100] rev 831
Merge

Wed, 10 Feb 2010 19:05:20 +0100Handle graph changes in the MCF algorithms (#327)
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 10 Feb 2010 19:05:20 +0100] rev 830
Handle graph changes in the MCF algorithms (#327)

The reset() functions are renamed to resetParams() and the new reset()
functions handle the graph chnages, as well.

Fri, 12 Feb 2010 22:17:20 +0100Merge
Alpar Juttner <alpar@cs.elte.hu> [Fri, 12 Feb 2010 22:17:20 +0100] rev 829
Merge

Thu, 11 Feb 2010 07:40:29 +0100Doc improvements for planarity related tools (#62)
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 11 Feb 2010 07:40:29 +0100] rev 828
Doc improvements for planarity related tools (#62)

Thu, 11 Feb 2010 07:39:57 +0100Port planar image from SVN -r3524 (#62)
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 11 Feb 2010 07:39:57 +0100] rev 827
Port planar image from SVN -r3524 (#62)

Fri, 12 Feb 2010 21:53:15 +0100Merge
Alpar Juttner <alpar@cs.elte.hu> [Fri, 12 Feb 2010 21:53:15 +0100] rev 826
Merge

Fri, 12 Feb 2010 11:00:20 +0100Add doc for the traits class parameters (#315)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 12 Feb 2010 11:00:20 +0100] rev 825
Add doc for the traits class parameters (#315)

Thu, 11 Feb 2010 16:55:54 +0000Add more information on Makefile variables (#316)
Akos Ladanyi <ladanyi@tmit.bme.hu> [Thu, 11 Feb 2010 16:55:54 +0000] rev 824
Add more information on Makefile variables (#316)

Tue, 09 Feb 2010 23:29:51 +0100Add a warning about huge capacities in Preflow (#319)
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 09 Feb 2010 23:29:51 +0100] rev 823
Add a warning about huge capacities in Preflow (#319)

Mon, 14 Dec 2009 06:07:52 +0100Merge #180 and a bugfix in #51
Alpar Juttner <alpar@cs.elte.hu> [Mon, 14 Dec 2009 06:07:52 +0100] rev 822
Merge #180 and a bugfix in #51

Fri, 13 Nov 2009 00:39:28 +0100Small bug fixes (#180)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 13 Nov 2009 00:39:28 +0100] rev 821
Small bug fixes (#180)

Fri, 13 Nov 2009 00:37:55 +0100Rename a private type in MCF classes (#180)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 13 Nov 2009 00:37:55 +0100] rev 820
Rename a private type in MCF classes (#180)

The new MCF algorithms define a private map type VectorMap,
which could be misleading, since there is an other VectorMap
defined in lemon/bits/vector_map.h. Thus the new type is
is renamed to StaticVectorMap.

Fri, 13 Nov 2009 00:24:39 +0100Adds tests for the new MCF algorithms (#180)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 13 Nov 2009 00:24:39 +0100] rev 819
Adds tests for the new MCF algorithms (#180)

Fri, 13 Nov 2009 00:23:07 +0100Rework the MCF test file to help extending it (#180)
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)

Fri, 13 Nov 2009 00:15:50 +0100Fixes in the heap concept to avoid warnings (#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)

Fri, 13 Nov 2009 00:11:11 +0100Add citations to CycleCanceling (#180, #184)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 13 Nov 2009 00:11:11 +0100] rev 816
Add citations to CycleCanceling (#180, #184)

Fri, 13 Nov 2009 00:10:33 +0100Entirely rework cycle canceling algorithms (#180)
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.