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 919
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 918
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 917
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 916
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 915
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 914
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 17:08:30 +0100Merge 4 backouts (#50, #312) 1.1
Alpar Juttner <alpar@cs.elte.hu> [Fri, 26 Feb 2010 17:08:30 +0100] rev 913
Merge 4 backouts (#50, #312)

Fri, 26 Feb 2010 17:07:13 +0100Back out 4 changesets (#50, #312) 1.1
Alpar Juttner <alpar@cs.elte.hu> [Fri, 26 Feb 2010 17:07:13 +0100] rev 912
Back out 4 changesets (#50, #312)
- 532697c9fa53
- bb8c4cd57900
- 9f529abcaebf
- 703ebf476a1d

Fri, 26 Feb 2010 14:00:20 +0100Merge #340
Alpar Juttner <alpar@cs.elte.hu> [Fri, 26 Feb 2010 14:00:20 +0100] rev 911
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 910
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 909
Merge bugfix #336

Sun, 21 Feb 2010 18:55:01 +0100Merge bugfix #336 to branch 1.1 1.1
Alpar Juttner <alpar@cs.elte.hu> [Sun, 21 Feb 2010 18:55:01 +0100] rev 908
Merge bugfix #336 to branch 1.1

Sun, 21 Feb 2010 18:54:45 +0100Merge bugfix #336 to branch 1.0 1.0
Alpar Juttner <alpar@cs.elte.hu> [Sun, 21 Feb 2010 18:54:45 +0100] rev 907
Merge bugfix #336 to branch 1.0

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 906
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 905
Modify the header of scripts/bib2dox.py (#184)