Peter Kovacs <kpeter@inf.elte.hu> [Tue, 22 Jun 2010 16:13:00 +0200] rev 989
Improve graph_copy_test.cc
Alpar Juttner <alpar@cs.elte.hu> [Fri, 25 Jun 2010 06:41:55 +0200] rev 988
Merge bugfix #371
Alpar Juttner <alpar@cs.elte.hu> [Fri, 25 Jun 2010 06:00:56 +0200] rev 987
Merge bugfix #372
Alpar Juttner <alpar@cs.elte.hu> [Fri, 25 Jun 2010 06:20:28 +0200] rev 986
Merge bugfix #371 to branch 1.2
Alpar Juttner <alpar@cs.elte.hu> [Fri, 25 Jun 2010 05:54:56 +0200] rev 985
Merge bugfix #372 to branch 1.2
Alpar Juttner <alpar@cs.elte.hu> [Fri, 25 Jun 2010 06:15:43 +0200] rev 984
Merge bugfix #371 to branch 1.1
Alpar Juttner <alpar@cs.elte.hu> [Fri, 25 Jun 2010 05:48:27 +0200] rev 983
Merge bugfix #372 to branch 1.1
Balazs Dezso <deba@inf.elte.hu> [Thu, 24 Jun 2010 09:27:53 +0200] rev 982
Fix critical bug in preflow (#372)
The wrong transition between the bound decrease and highest active
heuristics caused the bug. The last node chosen in bound decrease mode
is used in the first iteration in highest active mode.
Alpar Juttner <alpar@cs.elte.hu> [Fri, 25 Jun 2010 06:03:25 +0200] rev 981
Merge bugfix #371 to branch 1.0
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 22 Jun 2010 15:39:26 +0200] rev 980
Bug fix in (di)graphCopy() (#371)
The target graph is cleared before adding nodes and arcs/edges.
Alpar Juttner <alpar@cs.elte.hu> [Mon, 03 May 2010 10:56:24 +0200] rev 979
Merge bugfix #368
Alpar Juttner <alpar@cs.elte.hu> [Mon, 03 May 2010 10:24:52 +0200] rev 978
Merge bugfix #368 to branch 1.2
Alpar Juttner <alpar@cs.elte.hu> [Mon, 03 May 2010 10:16:01 +0200] rev 977
Merge bugfix #368 to branch 1.1
Peter Kovacs <kpeter@inf.elte.hu> [Sun, 02 May 2010 18:53:56 +0200] rev 976
Fix the usage of min() (#368)
Alpar Juttner <alpar@cs.elte.hu> [Mon, 12 Apr 2010 17:05:49 +0200] rev 975
Merge bugfix #366
Alpar Juttner <alpar@cs.elte.hu> [Mon, 12 Apr 2010 17:00:05 +0200] rev 974
Merge bugfix #366 to branch 1.2
Alpar Juttner <alpar@cs.elte.hu> [Mon, 12 Apr 2010 16:52:48 +0200] rev 973
Merge bugfix #366 to branch 1.1
Alpar Juttner <alpar@cs.elte.hu> [Mon, 12 Apr 2010 16:49:51 +0200] rev 972
Merge bugfix #366 to branch 1.0
Balazs Dezso <deba@inf.elte.hu> [Mon, 12 Apr 2010 13:59:41 +0200] rev 971
Fix PredMatrixMapPath::empty() (#366)
Gabor Retvari <retvari@tmit.bme.hu> [Sun, 11 Apr 2010 22:28:42 +0200] rev 970
Fix PredMapPath::empty() (#366)
Alpar Juttner <alpar@cs.elte.hu> [Tue, 06 Apr 2010 07:04:38 +0200] rev 969
Merge bugfix #364
Alpar Juttner <alpar@cs.elte.hu> [Tue, 06 Apr 2010 06:52:48 +0200] rev 968
Merge bugfix #364 to branch 1.2
Alpar Juttner <alpar@cs.elte.hu> [Tue, 06 Apr 2010 06:43:04 +0200] rev 967
Merge bugfix #364 to branch 1.1
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 05 Apr 2010 23:41:05 +0200] rev 966
Add an undirected() function (#364)
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 05 Apr 2010 23:33:57 +0200] rev 965
Add missing UndirectedTags (#364)
Alpar Juttner <alpar@cs.elte.hu> [Fri, 19 Mar 2010 09:15:57 +0100] rev 964
LEMON 1.2 released (3ed8f7c8bed8 tagged as r1.2)
Alpar Juttner <alpar@cs.elte.hu> [Thu, 18 Mar 2010 14:50:32 +0100] rev 963
Merge #341, #360, #51, #359 to branch 1.2
Alpar Juttner <alpar@cs.elte.hu> [Wed, 17 Mar 2010 14:05:23 +0100] rev 962
Update NEWS file
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 18 Mar 2010 00:29:35 +0100] rev 961
Trim the documentation (#359)
Alpar Juttner <alpar@cs.elte.hu> [Thu, 18 Mar 2010 14:17:03 +0100] rev 960
Merge backout of a6eb9698c321 (#360,#51)
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 18 Mar 2010 00:30:25 +0100] rev 959
Small doc fixes and improvements (#359)
Alpar Juttner <alpar@cs.elte.hu> [Thu, 18 Mar 2010 13:18:58 +0100] rev 958
Backed out changeset a6eb9698c321 (#360, #51)
Alpar Juttner <alpar@cs.elte.hu> [Wed, 17 Mar 2010 14:07:28 +0100] rev 957
Release branch 1.2 created
Alpar Juttner <alpar@cs.elte.hu> [Sat, 06 Mar 2010 14:35:12 +0000] rev 956
Unify the sources (#339)
Balazs Dezso <deba@inf.elte.hu> [Wed, 17 Mar 2010 12:35:52 +0100] rev 955
Fix multiple executions in matchings (fract. mathcings) (#356)
Alpar Juttner <alpar@cs.elte.hu> [Wed, 17 Mar 2010 10:29:57 +0100] rev 954
Merge #356
Alpar Juttner <alpar@cs.elte.hu> [Tue, 16 Mar 2010 21:27:35 +0100] rev 953
Merge #314
Alpar Juttner <alpar@cs.elte.hu> [Tue, 16 Mar 2010 21:18:39 +0100] rev 952
Minor doc fix related to #348
Balazs Dezso <deba@inf.elte.hu> [Thu, 04 Mar 2010 15:20:59 +0100] rev 951
Uniforming primal scale to 2 (#314)
Balazs Dezso <deba@inf.elte.hu> [Thu, 04 Mar 2010 10:17:02 +0100] rev 950
Fix documentation issues (#314)
Balazs Dezso <deba@inf.elte.hu> [Sat, 26 Sep 2009 10:17:31 +0200] rev 949
Fractional matching initialization of weighted matchings (#314)
Balazs Dezso <deba@inf.elte.hu> [Fri, 25 Sep 2009 21:51:36 +0200] rev 948
Add fractional matching algorithms (#314)
Balazs Dezso <deba@inf.elte.hu> [Sun, 20 Sep 2009 21:38:24 +0200] rev 947
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.
Alpar Juttner <alpar@cs.elte.hu> [Wed, 17 Mar 2010 10:23:17 +0100] rev 946
Merge bugfix #356 to branch 1.1
Balazs Dezso <deba@inf.elte.hu> [Tue, 16 Mar 2010 21:12:10 +0100] rev 945
Fix multiple execution bug in weighted matchings (#356)
This chgset also redoes the fix of [28c7ad6f8d91] and its backpont to 1.1,
[268a052c3043].
Alpar Juttner <alpar@cs.elte.hu> [Sun, 14 Mar 2010 09:14:05 +0100] rev 944
Add doc/references.dox to .hgignore
Alpar Juttner <alpar@cs.elte.hu> [Sun, 14 Mar 2010 09:13:04 +0100] rev 943
Replace figure at matching doc #348
The original bibartite_matching.eps is kept for future use.
Peter Kovacs <kpeter@inf.elte.hu> [Sat, 13 Mar 2010 22:01:38 +0100] rev 942
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
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 08 Mar 2010 08:33:41 +0100] rev 941
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.)
Alpar Juttner <alpar@cs.elte.hu> [Sun, 07 Mar 2010 09:49:42 +0000] rev 940
LEMON 1.1.2 released (86a880ba752d tagged as r1.1.2)
Alpar Juttner <alpar@cs.elte.hu> [Sun, 07 Mar 2010 09:42:47 +0000] rev 939
Update NEWS file
Alpar Juttner <alpar@cs.elte.hu> [Sun, 07 Mar 2010 09:40:30 +0000] rev 938
LEMON 1.0.5 released (50b6b66daafd tagged as r1.0.5)
Alpar Juttner <alpar@cs.elte.hu> [Sun, 07 Mar 2010 09:34:56 +0000] rev 937
Update NEWS file
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 04 Mar 2010 10:03:14 +0100] rev 936
Clarify type names in NetworkSimplex (#353)
This patch clarifies the misleading effects of the renamings
in [f3bc4e9b5f3a].
Alpar Juttner <alpar@cs.elte.hu> [Wed, 03 Mar 2010 20:48:29 +0000] rev 935
Merge #306
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 02 Mar 2010 10:03:07 +0100] rev 934
Add tolerance() functions for HaoOrlin (#306)
Alpar Juttner <alpar@cs.elte.hu> [Wed, 03 Mar 2010 17:22:13 +0000] rev 933
Merge #301
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 02 Mar 2010 10:27:47 +0100] rev 932
Also test fullInit() in suurballe_test (#181, #323)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 16 Oct 2009 09:35:46 +0200] rev 931
Add traits class + named parameters to Suurballe (#323)
The following types can be modified using named parameters:
- FlowMap
- PotentialMap
- Path
- Heap + HeapCrossRef
Alpar Juttner <alpar@cs.elte.hu> [Wed, 03 Mar 2010 17:14:17 +0000] rev 930
Merge #181, #323
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 29 Sep 2009 13:32:01 +0200] rev 929
Rename heap structures (#301)
- KaryHeap --> DHeap
- FouraryHeap --> QuadHeap
- BinomHeap --> BinomialHeap
Alpar Juttner <alpar@cs.elte.hu> [Wed, 03 Mar 2010 16:00:08 +0000] rev 928
Merge bugfixes #323 to branch 1.1
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 16 Oct 2009 02:32:30 +0200] rev 927
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.
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 16 Oct 2009 01:06:16 +0200] rev 926
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.