hegyi [Tue, 08 Apr 2008 11:38:17 +0000] rev 2601
Rel.07 NEWS - 2. round
hegyi [Mon, 07 Apr 2008 16:28:20 +0000] rev 2600
NEWS file updated for Release 0.7
alpar [Thu, 03 Apr 2008 12:06:48 +0000] rev 2599
Serious bugfix in Random::gamma()
Backport from hg b6bede534255
deba [Tue, 25 Mar 2008 16:28:06 +0000] rev 2598
Minor bug fix
deba [Thu, 20 Mar 2008 16:57:12 +0000] rev 2597
Correcting broken repo
deba [Thu, 20 Mar 2008 16:25:47 +0000] rev 2596
Back porting commit 81563e019fa4
deba [Thu, 20 Mar 2008 11:38:01 +0000] rev 2595
Bug fix for not connected graphs
deba [Fri, 14 Mar 2008 14:50:04 +0000] rev 2594
Executable property removed
kpeter [Fri, 07 Mar 2008 00:24:23 +0000] rev 2593
Fix static member initializations (ticket #30).
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.
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.
ladanyi [Sat, 01 Mar 2008 20:07:29 +0000] rev 2590
There is no 'long long int' type in C++98 (only in C99).
kpeter [Fri, 29 Feb 2008 16:09:29 +0000] rev 2589
Bug fix in CapacityScaling.
kpeter [Fri, 29 Feb 2008 15:57:52 +0000] rev 2588
Small improvements in min cost flow files.
kpeter [Fri, 29 Feb 2008 15:55:39 +0000] rev 2587
External flow and potential maps can be used in MinCostMaxFlow.
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.
deba [Thu, 28 Feb 2008 16:33:40 +0000] rev 2585
Backport of bug fix hg 2de55e4f57a7
kpeter [Thu, 28 Feb 2008 02:58:26 +0000] rev 2584
Test file for the min cost flow algorithms.
kpeter [Thu, 28 Feb 2008 02:57:36 +0000] rev 2583
Small fixes and doc improvements in MinMeanCycle.
kpeter [Thu, 28 Feb 2008 02:55:23 +0000] rev 2582
Avoid map copy in MinCostMaxFlow.
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.
deba [Wed, 27 Feb 2008 11:39:03 +0000] rev 2580
Bug fixes
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.
ladanyi [Thu, 21 Feb 2008 13:06:33 +0000] rev 2578
Put the definitions of global functions into a .cc file.
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.
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.
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.
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.