Fri, 13 Nov 2009 12:33:33 +0100Bug fix in map_extender.h (#330)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 13 Nov 2009 12:33:33 +0100] rev 801
Bug fix in map_extender.h (#330)

Thu, 10 Dec 2009 09:14:47 +0100Fix clear() function in ExtendFindEnum (#335)
Balazs Dezso <deba@inf.elte.hu> [Thu, 10 Dec 2009 09:14:47 +0100] rev 800
Fix clear() function in ExtendFindEnum (#335)

Wed, 09 Dec 2009 11:14:06 +0100Merge #62
Alpar Juttner <alpar@cs.elte.hu> [Wed, 09 Dec 2009 11:14:06 +0100] rev 799
Merge #62

Sun, 04 Oct 2009 10:15:32 +0200Planarity checking function instead of class (#62)
Balazs Dezso <deba@inf.elte.hu> [Sun, 04 Oct 2009 10:15:32 +0200] rev 798
Planarity checking function instead of class (#62)

Wed, 09 Sep 2009 15:32:03 +0200Port planarity related algorithms from SVN 3509 (#62)
Balazs Dezso <deba@inf.elte.hu> [Wed, 09 Sep 2009 15:32:03 +0200] rev 797
Port planarity related algorithms from SVN 3509 (#62)

Fri, 20 Nov 2009 14:18:33 +0100Merge
Alpar Juttner <alpar@cs.elte.hu> [Fri, 20 Nov 2009 14:18:33 +0100] rev 796
Merge

Wed, 18 Nov 2009 21:21:26 +0100Fix in HartmannOrlin algorithm (#333)
Balazs Dezso <deba@inf.elte.hu> [Wed, 18 Nov 2009 21:21:26 +0100] rev 795
Fix in HartmannOrlin algorithm (#333)

Thu, 19 Nov 2009 09:36:43 +0100Valgring option for ./scripts/bootstrap.sh
Alpar Juttner <alpar@cs.elte.hu> [Thu, 19 Nov 2009 09:36:43 +0100] rev 794
Valgring option for ./scripts/bootstrap.sh

Wed, 18 Nov 2009 18:37:21 +0000Optionally use valgrind when running tests + other build system fixes
Akos Ladanyi <ladanyi@tmit.bme.hu> [Wed, 18 Nov 2009 18:37:21 +0000] rev 793
Optionally use valgrind when running tests + other build system fixes

Wed, 18 Nov 2009 14:38:38 +0100Merge
Alpar Juttner <alpar@cs.elte.hu> [Wed, 18 Nov 2009 14:38:38 +0100] rev 792
Merge

Wed, 18 Nov 2009 14:22:52 +0100Merge
Alpar Juttner <alpar@cs.elte.hu> [Wed, 18 Nov 2009 14:22:52 +0100] rev 791
Merge

Wed, 18 Nov 2009 14:21:35 +0100Fix gcc-4.4 compilation warning
Alpar Juttner <alpar@cs.elte.hu> [Wed, 18 Nov 2009 14:21:35 +0100] rev 790
Fix gcc-4.4 compilation warning

Fri, 13 Nov 2009 12:47:13 +0100Map utility functions (#320)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 13 Nov 2009 12:47:13 +0100] rev 789
Map utility functions (#320)

Wed, 18 Nov 2009 14:38:02 +0100Merge
Alpar Juttner <alpar@cs.elte.hu> [Wed, 18 Nov 2009 14:38:02 +0100] rev 788
Merge

Sun, 15 Nov 2009 19:57:02 +0100Various doc improvements (#331)
Peter Kovacs <kpeter@inf.elte.hu> [Sun, 15 Nov 2009 19:57:02 +0100] rev 787
Various doc improvements (#331)

- Add notes to the graph classes about the time of
item counting.
- Clarify the doc for run() in BFS and DFS.
- Other improvements.

Fri, 13 Nov 2009 18:10:06 +0100Small doc fixes in several files (#331)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 13 Nov 2009 18:10:06 +0100] rev 786
Small doc fixes in several files (#331)

Fri, 13 Nov 2009 17:30:26 +0100Doc improvements for Path and PathDumper concepts (#331)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 13 Nov 2009 17:30:26 +0100] rev 785
Doc improvements for Path and PathDumper concepts (#331)

Thu, 05 Nov 2009 15:50:01 +0100Merge #321
Alpar Juttner <alpar@cs.elte.hu> [Thu, 05 Nov 2009 15:50:01 +0100] rev 784
Merge #321

Thu, 05 Nov 2009 15:48:01 +0100Merge #293
Alpar Juttner <alpar@cs.elte.hu> [Thu, 05 Nov 2009 15:48:01 +0100] rev 783
Merge #293

Thu, 05 Nov 2009 10:27:17 +0100Merge
Alpar Juttner <alpar@cs.elte.hu> [Thu, 05 Nov 2009 10:27:17 +0100] rev 782
Merge

Mon, 28 Sep 2009 15:53:20 +0200Small fixes related to BellmanFord (#51)
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 28 Sep 2009 15:53:20 +0200] rev 781
Small fixes related to BellmanFord (#51)

- Add a missing #include.
- Add a missing const keyword for negativeCycle().
- Test if negativeCycle() is const function.

Thu, 05 Nov 2009 10:23:16 +0100Merge #68 (Port static graph implementation)
Alpar Juttner <alpar@cs.elte.hu> [Thu, 05 Nov 2009 10:23:16 +0100] rev 780
Merge #68 (Port static graph implementation)

Thu, 05 Nov 2009 10:01:02 +0100Merge
Alpar Juttner <alpar@cs.elte.hu> [Thu, 05 Nov 2009 10:01:02 +0100] rev 779
Merge

Tue, 29 Sep 2009 13:03:34 +0200Make some graph member functions static (#311, #68)
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 29 Sep 2009 13:03:34 +0200] rev 778
Make some graph member functions static (#311, #68)

Tue, 29 Sep 2009 12:03:02 +0200Add a new build() function to StaticDigraph (#68)
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 29 Sep 2009 12:03:02 +0200] rev 777
Add a new build() function to StaticDigraph (#68)

This function builds the digraph from an arc list that
contains pairs of integer indices from the range [0..n-1].
It is useful in the cases when you would like to build a
StaticDigraph from scratch, i.e. you do not want to build
another digraph that can be copied using the other build()
function.

Tue, 29 Sep 2009 10:39:20 +0200Extend the interface of StaticDigraph (#68)
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 29 Sep 2009 10:39:20 +0200] rev 776
Extend the interface of StaticDigraph (#68)
with index(), arc() and node() functions similarly to
other static graph structures.

Tue, 25 Aug 2009 16:32:47 +0200Add documentation for StaticDigraph (#68)
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 25 Aug 2009 16:32:47 +0200] rev 775
Add documentation for StaticDigraph (#68)

Tue, 25 Aug 2009 13:58:43 +0200Small improvements + add tests for StaticDigraph (#68)
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 25 Aug 2009 13:58:43 +0200] rev 774
Small improvements + add tests for StaticDigraph (#68)

Tue, 25 Aug 2009 11:09:02 +0200Port StaticDigraph from SVN -r3524 (#68)
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 25 Aug 2009 11:09:02 +0200] rev 773
Port StaticDigraph from SVN -r3524 (#68)

Fri, 16 Oct 2009 09:50:18 +0200Small fix in the doc (#179)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 16 Oct 2009 09:50:18 +0200] rev 772
Small fix in the doc (#179)

Thu, 15 Oct 2009 12:55:41 +0200Add citations to the min mean cycle classes (#179, #184)
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 15 Oct 2009 12:55:41 +0200] rev 771
Add citations to the min mean cycle classes (#179, #184)

Thu, 05 Nov 2009 08:39:49 +0100Merge #179 (Port the min mean cycle algorithms)
Alpar Juttner <alpar@cs.elte.hu> [Thu, 05 Nov 2009 08:39:49 +0100] rev 770
Merge #179 (Port the min mean cycle algorithms)

Tue, 18 Aug 2009 10:08:28 +0200Add tolerance() functions for MMC classes (#179)
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 18 Aug 2009 10:08:28 +0200] rev 769
Add tolerance() functions for MMC classes (#179)

Wed, 12 Aug 2009 09:45:15 +0200Separate group for the min mean cycle classes (#179)
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 12 Aug 2009 09:45:15 +0200] rev 768
Separate group for the min mean cycle classes (#179)

Tue, 11 Aug 2009 22:52:35 +0200Simplify comparisons in min mean cycle classes (#179)
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 11 Aug 2009 22:52:35 +0200] rev 767
Simplify comparisons in min mean cycle classes (#179)
using extreme INF values instead of bool flags.

Tue, 11 Aug 2009 21:53:39 +0200Add HartmannOrlin algorithm class (#179)
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 11 Aug 2009 21:53:39 +0200] rev 766
Add HartmannOrlin algorithm class (#179)
This algorithm is an improved version of Karp's original method,
it applies an efficient early termination scheme.
The interface is the same as Karp's and Howard's interface.

Tue, 11 Aug 2009 20:55:40 +0200Add Karp algorithm class (#179)
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 11 Aug 2009 20:55:40 +0200] rev 765
Add Karp algorithm class (#179)
based on the MinMeanCycle implementation in SVN -r3436.
The interface is reworked to be the same as Howard's interface.

Mon, 10 Aug 2009 14:50:57 +0200Rename MinMeanCycle to Howard (#179)
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 10 Aug 2009 14:50:57 +0200] rev 764
Rename MinMeanCycle to Howard (#179)

Fri, 07 Aug 2009 14:52:40 +0200Add a detailed test file for MinMeanCycle and fix test_tools.h (#179)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 07 Aug 2009 14:52:40 +0200] rev 763
Add a detailed test file for MinMeanCycle and fix test_tools.h (#179)

Thu, 06 Aug 2009 20:31:04 +0200Rename cyclePath() to cycle() in MinMeanCycle (#179)
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 06 Aug 2009 20:31:04 +0200] rev 762
Rename cyclePath() to cycle() in MinMeanCycle (#179)

Thu, 06 Aug 2009 20:28:28 +0200Traits class + named parameters for MinMeanCycle (#179)
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 06 Aug 2009 20:28:28 +0200] rev 761
Traits class + named parameters for MinMeanCycle (#179)

- Add a Traits class defining LargeValue, Tolerance, Path types.
LargeValue is used for internal computations, it is 'long long'
if the length type is integer, otherwise it is 'double'.
- Add named template parameters for LargeValue and Path types.
- Improve numerical stability: remove divisions from the internal
computations. If the arc lengths are integers, then all used
values are integers (except for the cycleMean() query function,
of course).

Thu, 06 Aug 2009 20:12:43 +0200Rework and fix the implementation of MinMeanCycle (#179)
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 06 Aug 2009 20:12:43 +0200] rev 760
Rework and fix the implementation of MinMeanCycle (#179)

- Fix the handling of the cycle means.
- Many implementation improvements:
- More efficient data storage for the strongly connected
components.
- Better handling of BFS queues.
- Merge consecutive BFS searches (perform two BFS searches
instead of three).

This version is about two times faster on average and an order of
magnitude faster if there are a lot of strongly connected components.

Mon, 03 Aug 2009 14:35:38 +0200Simplify the interface of MinMeanCycle (#179)
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 03 Aug 2009 14:35:38 +0200] rev 759
Simplify the interface of MinMeanCycle (#179)
Remove init() and reset(), and move their content into findMinMean().

Mon, 03 Aug 2009 14:12:55 +0200Port MinMeanCycle from SVN -r3524 (#179)
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 03 Aug 2009 14:12:55 +0200] rev 758
Port MinMeanCycle from SVN -r3524 (#179)
with some doc improvements

Thu, 05 Nov 2009 06:26:18 +0100Merge #184
Alpar Juttner <alpar@cs.elte.hu> [Thu, 05 Nov 2009 06:26:18 +0100] rev 757
Merge #184

Sat, 10 Oct 2009 08:19:26 +0200Update Doxygen configuration file
Peter Kovacs <kpeter@inf.elte.hu> [Sat, 10 Oct 2009 08:19:26 +0200] rev 756
Update Doxygen configuration file

Sat, 10 Oct 2009 08:18:46 +0200Insert citations into the doc (#184)
Peter Kovacs <kpeter@inf.elte.hu> [Sat, 10 Oct 2009 08:18:46 +0200] rev 755
Insert citations into the doc (#184)

- Add general citations to modules.
- Add specific citations for max flow and min cost flow algorithms.
- Add citations for the supported LP and MIP solvers.
- Extend the main page.
- Replace inproceedings entries with the journal versions.
- Add a new bibtex entry about network simplex.
- Remove unwanted entries.

Sat, 10 Oct 2009 08:15:07 +0200Handle url fields in bib2dox.py (#184)
Peter Kovacs <kpeter@inf.elte.hu> [Sat, 10 Oct 2009 08:15:07 +0200] rev 754
Handle url fields in bib2dox.py (#184)
and modify the bibtex file using url fields.

Mon, 12 Oct 2009 17:02:03 +0100Merge bugfix #322
Alpar Juttner <alpar@cs.elte.hu> [Mon, 12 Oct 2009 17:02:03 +0100] rev 753
Merge bugfix #322

Mon, 12 Oct 2009 16:37:22 +0100Distribute LEMONConfig.cmake.in (#322)
Akos Ladanyi <ladanyi@tmit.bme.hu> [Mon, 12 Oct 2009 16:37:22 +0100] rev 752
Distribute LEMONConfig.cmake.in (#322)

Mon, 12 Oct 2009 15:37:13 +0100Merge bugfix in #250
Alpar Juttner <alpar@cs.elte.hu> [Mon, 12 Oct 2009 15:37:13 +0100] rev 751
Merge bugfix in #250

Mon, 05 Oct 2009 20:21:54 +0200Merge #317
Alpar Juttner <alpar@cs.elte.hu> [Mon, 05 Oct 2009 20:21:54 +0200] rev 750
Merge #317

Wed, 30 Sep 2009 11:17:00 +0200Remove unnecessary OsiCbc dependency (#317)
Balazs Dezso <deba@inf.elte.hu> [Wed, 30 Sep 2009 11:17:00 +0200] rev 749
Remove unnecessary OsiCbc dependency (#317)

Sun, 27 Sep 2009 09:47:20 +0200Fix (and improve) error message in mip_test.cc (#317)
Alpar Juttner <alpar@cs.elte.hu> [Sun, 27 Sep 2009 09:47:20 +0200] rev 748
Fix (and improve) error message in mip_test.cc (#317)

Mon, 05 Oct 2009 09:48:57 +0200Add soplex support to scripts/bootstrap.sh plus...
Alpar Juttner <alpar@cs.elte.hu> [Mon, 05 Oct 2009 09:48:57 +0200] rev 747
Add soplex support to scripts/bootstrap.sh plus...
it checks whether cbc and soplex are installed at the given prefix.

Sun, 04 Oct 2009 00:28:42 +0200Faster add row operation (#203)
Balazs Dezso <deba@inf.elte.hu> [Sun, 04 Oct 2009 00:28:42 +0200] rev 746
Faster add row operation (#203)

One virtual function call instead of more

Fri, 02 Oct 2009 17:03:43 +0200Improve bib2dox.py using \section for entiries (#184)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 02 Oct 2009 17:03:43 +0200] rev 745
Improve bib2dox.py using \section for entiries (#184)

Sat, 26 Sep 2009 10:15:49 +0200Integrate bib2dox.py into the build environments (#184)
Alpar Juttner <alpar@cs.elte.hu> [Sat, 26 Sep 2009 10:15:49 +0200] rev 744
Integrate bib2dox.py into the build environments (#184)

Sat, 26 Sep 2009 10:15:49 +0200Add bib->dox converter and initial references.bib (#184)
Peter Kovacs <kpeter@inf.elte.hu> [Sat, 26 Sep 2009 10:15:49 +0200] rev 743
Add bib->dox converter and initial references.bib (#184)

Wed, 30 Sep 2009 08:41:06 +0200Merge #311
Alpar Juttner <alpar@cs.elte.hu> [Wed, 30 Sep 2009 08:41:06 +0200] rev 742
Merge #311

Wed, 30 Sep 2009 08:36:43 +0200Merge
Alpar Juttner <alpar@cs.elte.hu> [Wed, 30 Sep 2009 08:36:43 +0200] rev 741
Merge

Tue, 29 Sep 2009 10:21:51 +0200Add a warning for List(Di)Graph::Snapshot (#311)
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 29 Sep 2009 10:21:51 +0200] rev 740
Add a warning for List(Di)Graph::Snapshot (#311)
and extend tests for snapshots

Mon, 28 Sep 2009 12:48:44 +0200Modify the implementation of ListDigraph::ArcIt (#311)
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 28 Sep 2009 12:48:44 +0200] rev 739
Modify the implementation of ListDigraph::ArcIt (#311)

The new implementation is based on out-arc iteration (like
ListGraph::ArcIt) instead of in-arc iteration to make it
consistent with the documentation.

Sun, 23 Aug 2009 11:13:21 +0200Much better implementation for node splitting (#311)
Peter Kovacs <kpeter@inf.elte.hu> [Sun, 23 Aug 2009 11:13:21 +0200] rev 738
Much better implementation for node splitting (#311)
in ListDigraph. This solution is the same as the one that
is used in SmartDigraph. It is much faster and does not
invalidate any iterator like the former implementation.

Sun, 23 Aug 2009 11:11:49 +0200Add a resize() function to HypercubeGraph (#311)
Peter Kovacs <kpeter@inf.elte.hu> [Sun, 23 Aug 2009 11:11:49 +0200] rev 737
Add a resize() function to HypercubeGraph (#311)
just like the similar functions in other static graph structures,
and extend the test files to check these functions.

Sun, 23 Aug 2009 11:10:40 +0200Add reserve functions to ListGraph and SmartGraph (#311)
Peter Kovacs <kpeter@inf.elte.hu> [Sun, 23 Aug 2009 11:10:40 +0200] rev 736
Add reserve functions to ListGraph and SmartGraph (#311)
ListDigraph and SmartDigraph already have such functions.

Sun, 23 Aug 2009 11:09:22 +0200Doc improvements, fixes and unifications for graphs (#311)
Peter Kovacs <kpeter@inf.elte.hu> [Sun, 23 Aug 2009 11:09:22 +0200] rev 735
Doc improvements, fixes and unifications for graphs (#311)

Sun, 23 Aug 2009 11:07:50 +0200Doc improvements and unification for graph concepts (#311)
Peter Kovacs <kpeter@inf.elte.hu> [Sun, 23 Aug 2009 11:07:50 +0200] rev 734
Doc improvements and unification for graph concepts (#311)

Tue, 29 Sep 2009 09:25:23 +0200Copyright notices added to scripts
Alpar Juttner <alpar@cs.elte.hu> [Tue, 29 Sep 2009 09:25:23 +0200] rev 733
Copyright notices added to scripts

Tue, 29 Sep 2009 09:25:00 +0200Simple interactive bootstrap script
Alpar Juttner <alpar@cs.elte.hu> [Tue, 29 Sep 2009 09:25:00 +0200] rev 732
Simple interactive bootstrap script

Sat, 26 Sep 2009 07:21:54 +0200Merge #298
Alpar Juttner <alpar@cs.elte.hu> [Sat, 26 Sep 2009 07:21:54 +0200] rev 731
Merge #298

Sat, 26 Sep 2009 07:16:22 +0200Merge
Alpar Juttner <alpar@cs.elte.hu> [Sat, 26 Sep 2009 07:16:22 +0200] rev 730
Merge

Fri, 25 Sep 2009 11:58:34 +0200Small improvements for NetworkSimplex (#298)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 25 Sep 2009 11:58:34 +0200] rev 729
Small improvements for NetworkSimplex (#298)

Thu, 02 Jul 2009 17:36:29 +0200Add a parameter to control arc mixing in NS (#298)
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 02 Jul 2009 17:36:29 +0200] rev 728
Add a parameter to control arc mixing in NS (#298)

Wed, 01 Jul 2009 16:34:01 +0200Small improvements in NS pivot rules (#298)
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 01 Jul 2009 16:34:01 +0200] rev 727
Small improvements in NS pivot rules (#298)

Sat, 26 Sep 2009 07:08:10 +0200Merge #302
Alpar Juttner <alpar@cs.elte.hu> [Sat, 26 Sep 2009 07:08:10 +0200] rev 726
Merge #302

Fri, 25 Sep 2009 12:24:16 +0200Add creator functions for IdMap and RangeIdMap (#302)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 25 Sep 2009 12:24:16 +0200] rev 725
Add creator functions for IdMap and RangeIdMap (#302)

Fri, 25 Sep 2009 12:22:42 +0200Rename ValueIterator to ValueIt in graph maps (#302)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 25 Sep 2009 12:22:42 +0200] rev 724
Rename ValueIterator to ValueIt in graph maps (#302)
but keep ValueIterator as an alias in CrossRefMap
(only for reverse compatibility).

Fri, 25 Sep 2009 12:12:37 +0200Extend maps_test.cc (#302)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 25 Sep 2009 12:12:37 +0200] rev 723
Extend maps_test.cc (#302)

Sun, 02 Aug 2009 17:22:43 +0200Doc improvements for several graph maps (#302)
Peter Kovacs <kpeter@inf.elte.hu> [Sun, 02 Aug 2009 17:22:43 +0200] rev 722
Doc improvements for several graph maps (#302)

Sun, 02 Aug 2009 13:44:45 +0200Merge
Peter Kovacs <kpeter@inf.elte.hu> [Sun, 02 Aug 2009 13:44:45 +0200] rev 721
Merge

Thu, 23 Jul 2009 18:13:59 +0200Improvements for graph maps (#302)
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 23 Jul 2009 18:13:59 +0200] rev 720
Improvements for graph maps (#302)

- Add a count() function to CrossRefMap.
- Add tests for IdMap and RangeIdMap.
- Extend tests for CrossRefMap.
- Improve the doc.

Fri, 25 Sep 2009 09:33:09 +0200Merge
Alpar Juttner <alpar@cs.elte.hu> [Fri, 25 Sep 2009 09:33:09 +0200] rev 719
Merge

Thu, 20 Aug 2009 20:34:30 +0200Also check ReferenceMapTag in concept checks (#312)
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 20 Aug 2009 20:34:30 +0200] rev 718
Also check ReferenceMapTag in concept checks (#312)

Fri, 25 Sep 2009 09:13:03 +0200Merge
Alpar Juttner <alpar@cs.elte.hu> [Fri, 25 Sep 2009 09:13:03 +0200] rev 717
Merge

Sun, 02 Aug 2009 12:40:20 +0200Small doc improvements (#304)
Peter Kovacs <kpeter@inf.elte.hu> [Sun, 02 Aug 2009 12:40:20 +0200] rev 716
Small doc improvements (#304)

Fri, 25 Sep 2009 09:06:32 +0200Merge
Alpar Juttner <alpar@cs.elte.hu> [Fri, 25 Sep 2009 09:06:32 +0200] rev 715
Merge

Fri, 24 Jul 2009 11:07:52 +0200Rearrange modules (#303)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 24 Jul 2009 11:07:52 +0200] rev 714
Rearrange modules (#303)

Fri, 24 Jul 2009 10:27:40 +0200Small doc improvements
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 24 Jul 2009 10:27:40 +0200] rev 713
Small doc improvements

Mon, 31 Aug 2009 20:27:38 +0200Merge
Alpar Juttner <alpar@cs.elte.hu> [Mon, 31 Aug 2009 20:27:38 +0200] rev 712
Merge

Wed, 08 Jul 2009 17:47:01 +0200Unify member names in heaps (#299)
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 08 Jul 2009 17:47:01 +0200] rev 711
Unify member names in heaps (#299)

The following renamings are made.

Public members:
- UnderFlowPriorityError -> PriorityUnderflowError
("underflow" is only one word)

Private members:
- bubble_up() -> bubbleUp()
- bubble_down() -> bubbleDown()
- second_child() -> secondChild()
- makeroot() -> makeRoot()
- relocate_last() -> relocateLast()
- data -> _data
- boxes -> _boxes

Wed, 08 Jul 2009 17:22:36 +0200Move the heaps to a separate group (#299)
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 08 Jul 2009 17:22:36 +0200] rev 710
Move the heaps to a separate group (#299)

Wed, 08 Jul 2009 17:21:30 +0200Improve and unify the documentation of heaps (#299)
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 08 Jul 2009 17:21:30 +0200] rev 709
Improve and unify the documentation of heaps (#299)
and avoid a warning in SimpleBucketHeap::operator[].

Mon, 31 Aug 2009 10:03:23 +0200Merge
Alpar Juttner <alpar@cs.elte.hu> [Mon, 31 Aug 2009 10:03:23 +0200] rev 708
Merge

Fri, 24 Jul 2009 01:07:45 +0200Much faster implementation for BinomHeap (#301)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 24 Jul 2009 01:07:45 +0200] rev 707
Much faster implementation for BinomHeap (#301)

Mon, 20 Jul 2009 19:06:39 +0200Smarter bubbleDown() in K-ary heaps (#301)
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 20 Jul 2009 19:06:39 +0200] rev 706
Smarter bubbleDown() in K-ary heaps (#301)

Fri, 10 Jul 2009 09:17:13 +0200Small improvements in heap implementations (#301)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 10 Jul 2009 09:17:13 +0200] rev 705
Small improvements in heap implementations (#301)

Fri, 10 Jul 2009 09:15:22 +0200Make K a template parameter in KaryHeap (#301)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 10 Jul 2009 09:15:22 +0200] rev 704
Make K a template parameter in KaryHeap (#301)

Thu, 09 Jul 2009 04:07:08 +0200Improve and unify the doc + names in the new heaps (#301)
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 09 Jul 2009 04:07:08 +0200] rev 703
Improve and unify the doc + names in the new heaps (#301)

Thu, 09 Jul 2009 02:39:47 +0200Bug fix in PairingHeap::pop() (#301)
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 09 Jul 2009 02:39:47 +0200] rev 702
Bug fix in PairingHeap::pop() (#301)

Thu, 09 Jul 2009 02:38:01 +0200Add fourary, k-ary, pairing and binomial heaps (#301)
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 09 Jul 2009 02:38:01 +0200] rev 701
Add fourary, k-ary, pairing and binomial heaps (#301)
These structures were implemented by Dorian Batha.

Mon, 31 Aug 2009 08:32:25 +0200Merge
Alpar Juttner <alpar@cs.elte.hu> [Mon, 31 Aug 2009 08:32:25 +0200] rev 700
Merge

Mon, 03 Aug 2009 00:54:04 +0200Add negativeCycle() function to BellmanFord (#51)
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 03 Aug 2009 00:54:04 +0200] rev 699
Add negativeCycle() function to BellmanFord (#51)

Mon, 03 Aug 2009 00:52:45 +0200Add a detailed test file for BellmanFord (#51)
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 03 Aug 2009 00:52:45 +0200] rev 698
Add a detailed test file for BellmanFord (#51)

Sun, 02 Aug 2009 13:24:46 +0200Improvements and unifications for BellmanFord (#51)
Peter Kovacs <kpeter@inf.elte.hu> [Sun, 02 Aug 2009 13:24:46 +0200] rev 697
Improvements and unifications for BellmanFord (#51)

- Rework the function type interface to fit to dijkstra().
- Rename named template parameters (Def* -> Set*).
- Rename some private member variables
(to start with an underscore).
- Simplify template parameter names.
- Many unifications and improvements in the doc.

Fri, 24 Jul 2009 23:19:43 +0200Port Bellman-Ford algorithm from SVN -r3524 (#51)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 24 Jul 2009 23:19:43 +0200] rev 696
Port Bellman-Ford algorithm from SVN -r3524 (#51)

Mon, 31 Aug 2009 08:25:33 +0200Merge
Alpar Juttner <alpar@cs.elte.hu> [Mon, 31 Aug 2009 08:25:33 +0200] rev 695
Merge

Tue, 21 Jul 2009 22:43:31 +0200Improvements for iterable maps (#73)
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 21 Jul 2009 22:43:31 +0200] rev 694
Improvements for iterable maps (#73)

Sat, 27 Jun 2009 13:07:26 +0200Port iterable maps from SVN 3509 (#73)
Balazs Dezso <deba@inf.elte.hu> [Sat, 27 Jun 2009 13:07:26 +0200] rev 693
Port iterable maps from SVN 3509 (#73)

Mon, 31 Aug 2009 07:22:26 +0200Merge
Alpar Juttner <alpar@cs.elte.hu> [Mon, 31 Aug 2009 07:22:26 +0200] rev 692
Merge

Mon, 03 Aug 2009 14:00:21 +0200Bug fix + extension in the rename script (#305)
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 03 Aug 2009 14:00:21 +0200] rev 691
Bug fix + extension in the rename script (#305)

Mon, 31 Aug 2009 07:12:58 +0200Merge
Alpar Juttner <alpar@cs.elte.hu> [Mon, 31 Aug 2009 07:12:58 +0200] rev 690
Merge