Peter Kovacs <kpeter@inf.elte.hu> [Thu, 12 Nov 2009 23:27:21 +0100] rev 873
Traits class + a named parameter for CapacityScaling (#180)
to specify the heap used in internal Dijkstra computations.
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 12 Nov 2009 23:26:13 +0100] rev 872
Entirely rework CapacityScaling (#180)
- Use the new interface similarly to NetworkSimplex.
- Rework the implementation using an efficient internal structure
for handling the residual network. This improvement made the
code much faster (up to 2-5 times faster on large graphs).
- Handle GEQ supply type (LEQ is not supported).
- Handle negative costs for arcs of finite capacity.
(Note that this algorithm cannot handle arcs of negative cost
and infinite upper bound, thus it returns UNBOUNDED if such
an arc exists.)
- Extend the documentation.
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 12 Nov 2009 23:17:34 +0100] rev 871
Port CapacityScaling from SVN -r3524 (#180)
Peter Kovacs <kpeter@inf.elte.hu> [Sun, 13 Dec 2009 22:19:08 +0100] rev 870
Memory leak bugfix in BellmanFord (#51)
Alpar Juttner <alpar@cs.elte.hu> [Thu, 10 Dec 2009 17:18:25 +0100] rev 869
Merge bugfix #330
Alpar Juttner <alpar@cs.elte.hu> [Thu, 10 Dec 2009 17:10:25 +0100] rev 868
Merge bugfix #330 to branch 1.1
Alpar Juttner <alpar@cs.elte.hu> [Thu, 10 Dec 2009 17:05:35 +0100] rev 867
Merge
Alpar Juttner <alpar@cs.elte.hu> [Thu, 10 Dec 2009 16:56:26 +0100] rev 866
Merge bugfix #330 to branch 1.0
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 13 Nov 2009 12:33:33 +0100] rev 865
Bug fix in map_extender.h (#330)
Balazs Dezso <deba@inf.elte.hu> [Thu, 10 Dec 2009 09:14:47 +0100] rev 864
Fix clear() function in ExtendFindEnum (#335)
Alpar Juttner <alpar@cs.elte.hu> [Wed, 09 Dec 2009 11:14:06 +0100] rev 863
Merge #62
Balazs Dezso <deba@inf.elte.hu> [Sun, 04 Oct 2009 10:15:32 +0200] rev 862
Planarity checking function instead of class (#62)
Balazs Dezso <deba@inf.elte.hu> [Wed, 09 Sep 2009 15:32:03 +0200] rev 861
Port planarity related algorithms from SVN 3509 (#62)
Alpar Juttner <alpar@cs.elte.hu> [Fri, 20 Nov 2009 14:18:33 +0100] rev 860
Merge
Balazs Dezso <deba@inf.elte.hu> [Wed, 18 Nov 2009 21:21:26 +0100] rev 859
Fix in HartmannOrlin algorithm (#333)
Alpar Juttner <alpar@cs.elte.hu> [Thu, 05 Nov 2009 16:01:39 +0100] rev 858
Merge fix #321
Alpar Juttner <alpar@cs.elte.hu> [Mon, 12 Oct 2009 17:01:03 +0100] rev 857
Merge bugfix #322
Alpar Juttner <alpar@cs.elte.hu> [Mon, 12 Oct 2009 15:30:18 +0100] rev 856
Merge bugfix in #250
Alpar Juttner <alpar@cs.elte.hu> [Mon, 05 Oct 2009 20:21:31 +0200] rev 855
Merge #317
Alpar Juttner <alpar@cs.elte.hu> [Sat, 03 Oct 2009 07:32:04 +0200] rev 854
LEMON 1.1.1 released (78b7231f0b2e tagged as r1.1.1)
Alpar Juttner <alpar@cs.elte.hu> [Sat, 03 Oct 2009 06:54:18 +0200] rev 853
Update NEWS file
Alpar Juttner <alpar@cs.elte.hu> [Mon, 31 Aug 2009 07:05:13 +0200] rev 852
Merge bugfix #307
Alpar Juttner <alpar@cs.elte.hu> [Thu, 20 Aug 2009 22:45:40 +0200] rev 851
Merge bugfix #311
Alpar Juttner <alpar@cs.elte.hu> [Thu, 20 Aug 2009 22:41:40 +0200] rev 850
Merge bugfix #302
Alpar Juttner <alpar@cs.elte.hu> [Fri, 24 Jul 2009 10:43:12 +0100] rev 849
Merge bugfix #302
Alpar Juttner <alpar@cs.elte.hu> [Mon, 01 Jun 2009 17:49:43 +0100] rev 848
Merge several CMAKE related improvements
Alpar Juttner <alpar@cs.elte.hu> [Thu, 28 May 2009 16:59:51 +0100] rev 847
Merge fix #295
Alpar Juttner <alpar@cs.elte.hu> [Wed, 13 May 2009 09:58:09 +0100] rev 846
LEMON 1.1 released (06f816565bef tagged as r1.1)
Alpar Juttner <alpar@cs.elte.hu> [Wed, 13 May 2009 09:50:14 +0100] rev 845
Merge various fixes
Alpar Juttner <alpar@cs.elte.hu> [Tue, 12 May 2009 12:09:55 +0100] rev 844
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 07 May 2009 02:05:12 +0200] rev 843
Remove references of missing tools (#257)
Alpar Juttner <alpar@cs.elte.hu> [Thu, 30 Apr 2009 11:48:04 +0100] rev 842
Release branch 1.1 created
Alpar Juttner <alpar@cs.elte.hu> [Thu, 19 Nov 2009 09:36:43 +0100] rev 841
Valgring option for ./scripts/bootstrap.sh
Akos Ladanyi <ladanyi@tmit.bme.hu> [Wed, 18 Nov 2009 18:37:21 +0000] rev 840
Optionally use valgrind when running tests + other build system fixes
Alpar Juttner <alpar@cs.elte.hu> [Wed, 18 Nov 2009 14:38:38 +0100] rev 839
Merge
Alpar Juttner <alpar@cs.elte.hu> [Wed, 18 Nov 2009 14:22:52 +0100] rev 838
Merge
Alpar Juttner <alpar@cs.elte.hu> [Wed, 18 Nov 2009 14:21:35 +0100] rev 837
Fix gcc-4.4 compilation warning
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 13 Nov 2009 12:47:13 +0100] rev 836
Map utility functions (#320)
Alpar Juttner <alpar@cs.elte.hu> [Wed, 18 Nov 2009 14:38:02 +0100] rev 835
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Sun, 15 Nov 2009 19:57:02 +0100] rev 834
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.
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 13 Nov 2009 18:10:06 +0100] rev 833
Small doc fixes in several files (#331)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 13 Nov 2009 17:30:26 +0100] rev 832
Doc improvements for Path and PathDumper concepts (#331)
Alpar Juttner <alpar@cs.elte.hu> [Thu, 05 Nov 2009 15:50:01 +0100] rev 831
Merge #321
Alpar Juttner <alpar@cs.elte.hu> [Thu, 05 Nov 2009 15:48:01 +0100] rev 830
Merge #293
Alpar Juttner <alpar@cs.elte.hu> [Thu, 05 Nov 2009 10:27:17 +0100] rev 829
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 28 Sep 2009 15:53:20 +0200] rev 828
Small fixes related to BellmanFord (#51)
- Add a missing #include.
- Add a missing const keyword for negativeCycle().
- Test if negativeCycle() is const function.
Alpar Juttner <alpar@cs.elte.hu> [Thu, 05 Nov 2009 10:23:16 +0100] rev 827
Merge #68 (Port static graph implementation)
Alpar Juttner <alpar@cs.elte.hu> [Thu, 05 Nov 2009 10:01:02 +0100] rev 826
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 29 Sep 2009 13:03:34 +0200] rev 825
Make some graph member functions static (#311, #68)
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 29 Sep 2009 12:03:02 +0200] rev 824
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.
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 29 Sep 2009 10:39:20 +0200] rev 823
Extend the interface of StaticDigraph (#68)
with index(), arc() and node() functions similarly to
other static graph structures.
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 25 Aug 2009 16:32:47 +0200] rev 822
Add documentation for StaticDigraph (#68)
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 25 Aug 2009 13:58:43 +0200] rev 821
Small improvements + add tests for StaticDigraph (#68)
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 25 Aug 2009 11:09:02 +0200] rev 820
Port StaticDigraph from SVN -r3524 (#68)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 16 Oct 2009 09:50:18 +0200] rev 819
Small fix in the doc (#179)
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 15 Oct 2009 12:55:41 +0200] rev 818
Add citations to the min mean cycle classes (#179, #184)
Alpar Juttner <alpar@cs.elte.hu> [Thu, 05 Nov 2009 08:39:49 +0100] rev 817
Merge #179 (Port the min mean cycle algorithms)
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 18 Aug 2009 10:08:28 +0200] rev 816
Add tolerance() functions for MMC classes (#179)
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 12 Aug 2009 09:45:15 +0200] rev 815
Separate group for the min mean cycle classes (#179)
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 11 Aug 2009 22:52:35 +0200] rev 814
Simplify comparisons in min mean cycle classes (#179)
using extreme INF values instead of bool flags.