Fri, 07 Mar 2008 00:24:23 +0000Fix static member initializations (ticket #30).
kpeter [Fri, 07 Mar 2008 00:24:23 +0000] rev 2593
Fix static member initializations (ticket #30).

Sun, 02 Mar 2008 22:55:27 +0000Revert to long long int since currently I don't know a better solution.
ladanyi [Sun, 02 Mar 2008 22:55:27 +0000] rev 2592
Revert to long long int since currently I don't know a better solution.

Sat, 01 Mar 2008 20:09:40 +0000In C++98 array size shall be an integral constant expression. Fixes
ladanyi [Sat, 01 Mar 2008 20:09:40 +0000] rev 2591
In C++98 array size shall be an integral constant expression. Fixes
ticket 12.

Sat, 01 Mar 2008 20:07:29 +0000There is no 'long long int' type in C++98 (only in C99).
ladanyi [Sat, 01 Mar 2008 20:07:29 +0000] rev 2590
There is no 'long long int' type in C++98 (only in C99).

Fri, 29 Feb 2008 16:09:29 +0000Bug fix in CapacityScaling.
kpeter [Fri, 29 Feb 2008 16:09:29 +0000] rev 2589
Bug fix in CapacityScaling.

Fri, 29 Feb 2008 15:57:52 +0000Small improvements in min cost flow files.
kpeter [Fri, 29 Feb 2008 15:57:52 +0000] rev 2588
Small improvements in min cost flow files.

Fri, 29 Feb 2008 15:55:39 +0000External flow and potential maps can be used in MinCostMaxFlow.
kpeter [Fri, 29 Feb 2008 15:55:39 +0000] rev 2587
External flow and potential maps can be used in MinCostMaxFlow.

Fri, 29 Feb 2008 15:55:13 +0000Reimplemented Suurballe class.
kpeter [Fri, 29 Feb 2008 15:55:13 +0000] rev 2586
Reimplemented Suurballe class.

- The new version is the specialized version of CapacityScaling.
- It is about 10-20 times faster than the former Suurballe algorithm
and about 20-50 percent faster than CapacityScaling.
- Doc improvements.
- The test file is also replaced.

Thu, 28 Feb 2008 16:33:40 +0000Backport of bug fix hg 2de55e4f57a7
deba [Thu, 28 Feb 2008 16:33:40 +0000] rev 2585
Backport of bug fix hg 2de55e4f57a7

Thu, 28 Feb 2008 02:58:26 +0000Test file for the min cost flow algorithms.
kpeter [Thu, 28 Feb 2008 02:58:26 +0000] rev 2584
Test file for the min cost flow algorithms.

Thu, 28 Feb 2008 02:57:36 +0000Small fixes and doc improvements in MinMeanCycle.
kpeter [Thu, 28 Feb 2008 02:57:36 +0000] rev 2583
Small fixes and doc improvements in MinMeanCycle.

Thu, 28 Feb 2008 02:55:23 +0000Avoid map copy in MinCostMaxFlow.
kpeter [Thu, 28 Feb 2008 02:55:23 +0000] rev 2582
Avoid map copy in MinCostMaxFlow.

Thu, 28 Feb 2008 02:54:27 +0000Query improvements in the min cost flow algorithms.
kpeter [Thu, 28 Feb 2008 02:54:27 +0000] rev 2581
Query improvements in the min cost flow algorithms.

- External flow and potential maps can be used.
- New query functions: flow() and potential().
- CycleCanceling also provides dual solution (node potentials).
- Doc improvements.

Wed, 27 Feb 2008 11:39:03 +0000Bug fixes
deba [Wed, 27 Feb 2008 11:39:03 +0000] rev 2580
Bug fixes

Mon, 25 Feb 2008 12:35:06 +0000Bug fixes in min cost flow files.
kpeter [Mon, 25 Feb 2008 12:35:06 +0000] rev 2579
Bug fixes in min cost flow files.
Use enum type instead of static constants in NetworkSimplex to avoid
linker errors.

Thu, 21 Feb 2008 13:06:33 +0000Put the definitions of global functions into a .cc file.
ladanyi [Thu, 21 Feb 2008 13:06:33 +0000] rev 2578
Put the definitions of global functions into a .cc file.

Mon, 18 Feb 2008 03:34:16 +0000Add a cost scaling min cost flow algorithm.
kpeter [Mon, 18 Feb 2008 03:34:16 +0000] rev 2577
Add a cost scaling min cost flow algorithm.

Add a cost scaling algorithm, which is performing generalized
push-relabel operations. It is almost as efficient as the capacity
scaling algorithm, but slower than network simplex.

Mon, 18 Feb 2008 03:32:56 +0000Improvements in MinCostFlow and MinCostMaxFlow.
kpeter [Mon, 18 Feb 2008 03:32:56 +0000] rev 2576
Improvements in MinCostFlow and MinCostMaxFlow.

Main changes:
- MinCostMaxFlow also provides dual solution.
- Change the name of private members to start with "_".
- Change the name of function parameters not to start with "_".
- Remove unnecessary documentation for private members.
- Doc improvements.

Mon, 18 Feb 2008 03:32:06 +0000Major improvements in NetworkSimplex.
kpeter [Mon, 18 Feb 2008 03:32:06 +0000] rev 2575
Major improvements in NetworkSimplex.

Main changes:
- Use -potenital[] instead of potential[] to conform to the usual
terminology.
- Use function parameter instead of #define commands to select pivot rule.
- Use much faster implementation for the candidate list pivot rule.
It is about 5-20 times faster now.
- Add a new pivot rule called "Limited Search" that is a modified
version of "Block Search". It is about 25 percent faster on rather
sparse graphs.
- By default "Limited Search" is used for sparse graphs and
"Block Search" is used otherwise. This combined method is the most
efficient on every input class.
- Change the name of private members to start with "_".
- Change the name of function parameters not to start with "_".
- Remove unnecessary documentation for private members.
- Many doc improvements.

Mon, 18 Feb 2008 03:30:53 +0000Improvements in CapacityScaling.
kpeter [Mon, 18 Feb 2008 03:30:53 +0000] rev 2574
Improvements in CapacityScaling.

Main changes:
- Use -potenital[] instead of potential[] to conform to the usual
terminology.
- Change the name of private members to start with "_".
- Change the name of function parameters not to start with "_".
- Remove unnecessary documentation for private members.
- Doc improvements.

Mon, 18 Feb 2008 03:30:12 +0000Improvements in CycleCanceling.
kpeter [Mon, 18 Feb 2008 03:30:12 +0000] rev 2573
Improvements in CycleCanceling.

Main changes:
- Use function parameter instead of #define commands to select negative
cycle detection method.
- Change the name of private members to start with "_".
- Change the name of function parameters not to start with "_".
- Remove unnecessary documentation for private members.
- Doc improvements.

Fri, 08 Feb 2008 11:58:32 +0000Fix VPATH builds.
ladanyi [Fri, 08 Feb 2008 11:58:32 +0000] rev 2572
Fix VPATH builds.

Fri, 08 Feb 2008 11:04:37 +0000Hopefully fix all compilation errors.
alpar [Fri, 08 Feb 2008 11:04:37 +0000] rev 2571
Hopefully fix all compilation errors.

Fri, 08 Feb 2008 10:42:38 +0000Fix a silly typo
alpar [Fri, 08 Feb 2008 10:42:38 +0000] rev 2570
Fix a silly typo

Fri, 08 Feb 2008 10:38:08 +0000#include<cmath> -> #include<lemon/math.h>
alpar [Fri, 08 Feb 2008 10:38:08 +0000] rev 2569
#include<cmath> -> #include<lemon/math.h>

Fri, 08 Feb 2008 10:18:55 +0000Math constants + configure bugfix backported
alpar [Fri, 08 Feb 2008 10:18:55 +0000] rev 2568
Math constants + configure bugfix backported
from hg a315a588a20d and 761622e5ed4c

Fri, 08 Feb 2008 09:56:46 +0000Update the server and the repository names to lemon.
alpar [Fri, 08 Feb 2008 09:56:46 +0000] rev 2567
Update the server and the repository names to lemon.

Fri, 08 Feb 2008 09:52:48 +0000Doc improvments backported from hg 9df0fe5e5109
alpar [Fri, 08 Feb 2008 09:52:48 +0000] rev 2566
Doc improvments backported from hg 9df0fe5e5109

Tue, 05 Feb 2008 12:45:23 +0000Bug fix in heap_test.cc.
kpeter [Tue, 05 Feb 2008 12:45:23 +0000] rev 2565
Bug fix in heap_test.cc.

Tue, 05 Feb 2008 12:41:05 +0000Several doc improvements and fixes in maps.h and concepts/maps.h.
kpeter [Tue, 05 Feb 2008 12:41:05 +0000] rev 2564
Several doc improvements and fixes in maps.h and concepts/maps.h.

Tue, 05 Feb 2008 11:24:32 +0000Small fixes in README.
kpeter [Tue, 05 Feb 2008 11:24:32 +0000] rev 2563
Small fixes in README.

Tue, 05 Feb 2008 11:23:23 +0000Improvements and fixes in dim2.h.
kpeter [Tue, 05 Feb 2008 11:23:23 +0000] rev 2562
Improvements and fixes in dim2.h.

- Several doc improvements.
- Fix BoundingBox::operator& implementation.

Tue, 05 Feb 2008 11:10:08 +0000Translate Hungarian varible names and improve messages in dim_test.cc.
kpeter [Tue, 05 Feb 2008 11:10:08 +0000] rev 2561
Translate Hungarian varible names and improve messages in dim_test.cc.

Tue, 05 Feb 2008 11:03:55 +0000Fix the rename script.
kpeter [Tue, 05 Feb 2008 11:03:55 +0000] rev 2560
Fix the rename script.

Tue, 29 Jan 2008 03:39:05 +0000grid_ugraph.h: fixed #18 (global functions inlined)
klao [Tue, 29 Jan 2008 03:39:05 +0000] rev 2559
grid_ugraph.h: fixed #18 (global functions inlined)

Mon, 28 Jan 2008 11:42:46 +0000Improved rename script to handle includes correctly.
kpeter [Mon, 28 Jan 2008 11:42:46 +0000] rev 2558
Improved rename script to handle includes correctly.

Mon, 21 Jan 2008 15:35:55 +0000Reveal an existing functionality in the documentation
alpar [Mon, 21 Jan 2008 15:35:55 +0000] rev 2557
Reveal an existing functionality in the documentation

Sun, 13 Jan 2008 10:32:14 +0000Cleanup in the minimum cost flow files.
kpeter [Sun, 13 Jan 2008 10:32:14 +0000] rev 2556
Cleanup in the minimum cost flow files.
The changes only affects the documentation and the look of the source codes.

Sun, 13 Jan 2008 10:26:55 +0000Reimplemented MinMeanCycle to be much more efficient.
kpeter [Sun, 13 Jan 2008 10:26:55 +0000] rev 2555
Reimplemented MinMeanCycle to be much more efficient.
The new version implements Howard's algorithm instead of Karp's algorithm and
it is at least 10-20 times faster on all the 40-50 random graphs we have tested.

Mon, 07 Jan 2008 17:07:40 +0000Minor doc fix
alpar [Mon, 07 Jan 2008 17:07:40 +0000] rev 2554
Minor doc fix

Mon, 07 Jan 2008 13:09:48 +0000Happy New Year to LEMON (+ better update-copyright-header script)
alpar [Mon, 07 Jan 2008 13:09:48 +0000] rev 2553
Happy New Year to LEMON (+ better update-copyright-header script)

Fri, 04 Jan 2008 00:47:08 +0000Improved rename script to avoid "undirected digraph".
kpeter [Fri, 04 Jan 2008 00:47:08 +0000] rev 2552
Improved rename script to avoid "undirected digraph".

Mon, 31 Dec 2007 19:21:21 +0000Include functional because of std::less.
ladanyi [Mon, 31 Dec 2007 19:21:21 +0000] rev 2551
Include functional because of std::less.

Sun, 30 Dec 2007 18:23:32 +0000Changing degree of tournament tree
deba [Sun, 30 Dec 2007 18:23:32 +0000] rev 2550
Changing degree of tournament tree
Bug fix in union find
Small efficiency improvment in bipartite matchings

Sat, 29 Dec 2007 15:11:41 +0000Test program for max weighted matchings
deba [Sat, 29 Dec 2007 15:11:41 +0000] rev 2549
Test program for max weighted matchings

Fri, 28 Dec 2007 11:00:51 +0000Edmond's Blossom shrinking algroithm:
deba [Fri, 28 Dec 2007 11:00:51 +0000] rev 2548
Edmond's Blossom shrinking algroithm:
MaxWeightedMatching
MaxWeightedPerfectMatching

Thu, 27 Dec 2007 13:40:16 +0000Renaming state_enum to State
deba [Thu, 27 Dec 2007 13:40:16 +0000] rev 2547
Renaming state_enum to State
Removing "Type" suffix from typedefs
Moving implementation into the class definition

Thu, 20 Dec 2007 15:21:22 +0000Bug fix in erase
deba [Thu, 20 Dec 2007 15:21:22 +0000] rev 2546
Bug fix in erase