Alpar Juttner <alpar@cs.elte.hu> [Wed, 09 Jul 2014 14:40:32 +0200] rev 1119
Restore cmake-2.8 compatibility (#502)
Fix cmake-2.8 incompatibility introduced in [fe4ff72e2f14].
Thanks to amluto for reporting the regression
Alpar Juttner <alpar@cs.elte.hu> [Mon, 07 Jul 2014 15:40:12 +0200] rev 1118
Merge bugfix #474
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 19 Aug 2013 22:35:54 +0200] rev 1117
Fix division by zero error in case of empty graph (#474)
Alpar Juttner <alpar@cs.elte.hu> [Mon, 07 Jul 2014 11:23:41 +0200] rev 1116
Specify lib dependencies for the main lib build (#481)
Alpar Juttner <alpar@cs.elte.hu> [Fri, 04 Jul 2014 13:41:22 +0200] rev 1115
Giving libemon.so a real soname (#482)
Alpar Juttner <alpar@cs.elte.hu> [Mon, 07 Jul 2014 11:20:13 +0200] rev 1114
CMAKE backward compatibility policy setting
Alpar Juttner <alpar@cs.elte.hu> [Mon, 07 Jul 2014 11:15:34 +0200] rev 1113
Remove unused variable from arc_look_up_test.cc
Alpar Juttner <alpar@cs.elte.hu> [Sat, 31 May 2014 07:00:14 +0200] rev 1112
Add missing include header and std:: namespace spec. (#487)
Alpar Juttner <alpar@cs.elte.hu> [Thu, 08 May 2014 17:20:25 +0200] rev 1111
CLANG compatible linker setting (#480)
Alpar Juttner <alpar@cs.elte.hu> [Tue, 08 Apr 2014 17:13:55 +0200] rev 1110
Merge bugfix #480
Alpar Juttner <alpar@cs.elte.hu> [Tue, 08 Apr 2014 16:54:29 +0200] rev 1109
Clang compatibility fix in lgf-gen.cc (#480)
Alpar Juttner <alpar@cs.elte.hu> [Tue, 08 Apr 2014 15:43:12 +0200] rev 1108
Bugfix in default LP/MIP setting (#465)
The bug was introduced in [fc3854d936f7]
Alpar Juttner <alpar@cs.elte.hu> [Tue, 08 Apr 2014 15:41:56 +0200] rev 1107
Require CMAKE 2.8 (#484)
Alpar Juttner <alpar@cs.elte.hu> [Wed, 22 Jan 2014 15:28:03 +0100] rev 1106
Bugfix in tsp_test (#476)
Alpar Juttner <alpar@cs.elte.hu> [Thu, 24 Oct 2013 13:04:00 +0200] rev 1105
Fix default LP/MIP setting (#479)
Alpar Juttner <alpar@cs.elte.hu> [Thu, 17 Oct 2013 15:08:41 +0200] rev 1104
Merge bugfix #478
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 17 Oct 2013 09:30:57 +0200] rev 1103
Rename field in min cost flow codes (#478)
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 17 Oct 2013 09:29:37 +0200] rev 1102
Fix debug checking + simplify lower bound handling (#478)
Alpar Juttner <alpar@cs.elte.hu> [Wed, 25 Sep 2013 11:15:56 +0200] rev 1101
Fix invalid map query in NearestNeighborTsp (#476)
Alpar Juttner <alpar@cs.elte.hu> [Sun, 11 Aug 2013 22:30:44 +0200] rev 1100
Resolve clang++-3.2 'unused variable warning's in bpgraph_test.cc (#472)
Alpar Juttner <alpar@cs.elte.hu> [Sun, 11 Aug 2013 22:01:06 +0200] rev 1099
Merge bugfix #471
Alpar Juttner <alpar@cs.elte.hu> [Sun, 11 Aug 2013 21:56:21 +0200] rev 1098
Merge headmerge to the default branch
Alpar Juttner <alpar@cs.elte.hu> [Sun, 11 Aug 2013 17:21:22 +0200] rev 1097
Have graph_to_eps.h compile with both gcc-3.3 and clang++-3.2 (#471)
Hopefully, it puts an end to the story of [115031ac8001] and [761fe0846f49].
Alpar Juttner <alpar@cs.elte.hu> [Sun, 11 Aug 2013 15:29:28 +0200] rev 1096
Merge >=1.2 branch heads
Alpar Juttner <alpar@cs.elte.hu> [Sun, 11 Aug 2013 15:28:12 +0200] rev 1095
Merge >=1.2 branch heads
Alpar Juttner <alpar@cs.elte.hu> [Fri, 09 Aug 2013 18:58:46 +0200] rev 1094
Update NEWS file
Alpar Juttner <alpar@cs.elte.hu> [Fri, 09 Aug 2013 11:29:40 +0200] rev 1093
Remove long lines (from all but one file)
Alpar Juttner <alpar@cs.elte.hu> [Fri, 09 Aug 2013 11:28:17 +0200] rev 1092
Apply unify-sources.sh to the source tree
Alpar Juttner <alpar@cs.elte.hu> [Fri, 09 Aug 2013 14:07:27 +0200] rev 1091
Merge bugfix #439
Alpar Juttner <alpar@cs.elte.hu> [Fri, 09 Aug 2013 11:07:27 +0200] rev 1090
Clarification in biNodeConnected() doc (#439)
Balazs Dezso <deba@google.com> [Thu, 08 Aug 2013 22:56:10 +0200] rev 1089
Fix biNodeConnected() function (#439)
Alpar Juttner <alpar@cs.elte.hu> [Thu, 28 Mar 2013 14:52:43 +0100] rev 1088
Add cmake config to find SoPlex (#460)
Based on the patch sent by ax487
Alpar Juttner <alpar@cs.elte.hu> [Wed, 07 Aug 2013 07:08:38 +0200] rev 1087
Further ignore_unused_variable_warning() explicit namespaces (#294)
Alpar Juttner <alpar@cs.elte.hu> [Wed, 07 Aug 2013 07:04:58 +0200] rev 1086
Merge #294
Alpar Juttner <alpar@cs.elte.hu> [Wed, 07 Aug 2013 06:57:41 +0200] rev 1085
Further ignore_unused_variable_warning() explicit namespaces (#294)
Alpar Juttner <alpar@cs.elte.hu> [Wed, 07 Aug 2013 06:55:05 +0200] rev 1084
Merge #294 to branches >=1.2
Alpar Juttner <alpar@cs.elte.hu> [Wed, 07 Aug 2013 06:29:34 +0200] rev 1083
Add explicit namespace to ignore_unused_variable_warning() usages (#294)
Alpar Juttner <alpar@cs.elte.hu> [Tue, 06 Aug 2013 17:58:59 +0200] rev 1082
Merge #463
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 06 Aug 2013 05:48:18 +0200] rev 1081
Use latex formatting for non-trivial O() expressions (#463)
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 06 Aug 2013 05:38:49 +0200] rev 1080
Use m instead of e for denoting the number of arcs/edges (#463)
Alpar Juttner <alpar@cs.elte.hu> [Tue, 06 Aug 2013 12:28:37 +0200] rev 1079
Merge further fixes #470
Alpar Juttner <alpar@cs.elte.hu> [Tue, 06 Aug 2013 12:04:13 +0200] rev 1078
Further fixes for gcc version 3.3 and 4.3 (#470)
Alpar Juttner <alpar@cs.elte.hu> [Tue, 06 Aug 2013 09:10:18 +0200] rev 1077
Unused local typedefs warning pragma is only applied to gcc>=4.8 (#470)
Alpar Juttner <alpar@cs.elte.hu> [Tue, 06 Aug 2013 06:52:36 +0200] rev 1076
Fix dummy doc comment (#459)
Alpar Juttner <alpar@cs.elte.hu> [Mon, 05 Aug 2013 14:21:58 +0200] rev 1075
Doxygen config improvements (#459)
- remove an erroneous line from DoxygenLayout.xml
- libstdc++ doxygen tagfile version is configurable
- use fixed gcc doc version (4.7.3) instead of the latest one
Alpar Juttner <alpar@cs.elte.hu> [Mon, 05 Aug 2013 14:03:29 +0200] rev 1074
Fix unresolved doc references (#459)
Alpar Juttner <alpar@cs.elte.hu> [Tue, 30 Jul 2013 15:54:46 +0200] rev 1073
Merge bugfix #461
Peter Kovacs <kpeter@inf.elte.hu> [Sat, 16 Mar 2013 16:50:39 +0100] rev 1072
Bugfix in assert.h (#461)
Alpar Juttner <alpar@cs.elte.hu> [Tue, 30 Jul 2013 15:24:45 +0200] rev 1071
Merge #454
Peter Kovacs <kpeter@inf.elte.hu> [Sat, 16 Mar 2013 16:20:41 +0100] rev 1070
Debug checking for capacity bounds in min cost flow algorithms (#454)
Alpar Juttner <alpar@cs.elte.hu> [Tue, 30 Jul 2013 15:14:29 +0200] rev 1069
Merge fix #470
Alpar Juttner <alpar@cs.elte.hu> [Tue, 30 Jul 2013 15:03:53 +0200] rev 1068
Suppress 'unused local typedefs' warnings, and resolve others (#470)
Alpar Juttner <alpar@cs.elte.hu> [Wed, 24 Jul 2013 10:21:35 +0200] rev 1067
Bugfix in test/maps_test.cc (#469)
Alpar Juttner <alpar@cs.elte.hu> [Wed, 24 Jul 2013 01:08:34 +0200] rev 1066
Fix #define indicating CPLEX availability (#446)
Alpar Juttner <alpar@cs.elte.hu> [Mon, 15 Jul 2013 08:33:08 +0200] rev 1065
Merge #446, #457, #465
Alpar Juttner <alpar@cs.elte.hu> [Sat, 25 May 2013 06:59:31 +0200] rev 1064
Enable/disable options for LP/MIP backends (#465)
Alpar Juttner <alpar@cs.elte.hu> [Fri, 20 Jul 2012 17:09:01 +0200] rev 1063
Add file export funcionality to LpBase (#457)
Alpar Juttner <alpar@cs.elte.hu> [Sat, 21 Jul 2012 10:18:57 +0200] rev 1062
Better CPLEX discovery (#446)
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 28 Feb 2013 23:45:39 +0100] rev 1061
Avoid usage of alternative operator (#177)
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 28 Feb 2013 23:44:35 +0100] rev 1060
Merge test files of Preflow and EdmondsKarp (#177)
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 28 Feb 2013 18:13:48 +0100] rev 1059
Rename flow init functions according to Preflow (#177)
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 28 Feb 2013 18:05:56 +0100] rev 1058
Rename DefFlowMap named parameter to SetFlowMap (#177)
in EdmondsKarp according to Preflow
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 28 Feb 2013 18:17:53 +0100] rev 1057
Improve and fix API doc of EdmondsKarp according to Preflow (#177)
Antal Nemes <thoneyvazul@gmail.com> [Tue, 30 Nov 2010 20:21:52 +0100] rev 1056
Port Edmonds-Karp algorithm from svn -r3524 (#177)
Alpar Juttner <alpar@cs.elte.hu> [Mon, 18 Mar 2013 18:48:58 +0100] rev 1055
Merge #442
Alpar Juttner <alpar@cs.elte.hu> [Tue, 05 Jun 2012 12:06:28 +0200] rev 1054
New features in time_measure.h (#442)
Alpar Juttner <alpar@cs.elte.hu> [Mon, 18 Mar 2013 17:41:19 +0100] rev 1053
Use doxygen's own bibtex support (#456)
Peter Kovacs <kpeter@inf.elte.hu> [Sat, 16 Mar 2013 14:11:32 +0100] rev 1052
Adjust the formatting of bib2dox.py to Doxygen 1.8.x (#459)
Peter Kovacs <kpeter@inf.elte.hu> [Sat, 16 Mar 2013 14:09:53 +0100] rev 1051
Add references to papers related to LEMON (#459)
Peter Kovacs <kpeter@inf.elte.hu> [Sat, 16 Mar 2013 13:16:27 +0100] rev 1050
Add images to the doc of two groups (#459)
Peter Kovacs <kpeter@inf.elte.hu> [Sat, 16 Mar 2013 13:14:35 +0100] rev 1049
Minor fixes and improvements in the doc (#459)
Alpar Juttner <alpar@cs.elte.hu> [Fri, 15 Mar 2013 17:19:17 +0100] rev 1048
Merge #411
Alpar Juttner <alpar@cs.elte.hu> [Fri, 15 Mar 2013 17:15:46 +0100] rev 1047
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 08 Mar 2013 01:13:54 +0100] rev 1046
Adjust image sizes in the documentation (#411)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 08 Mar 2013 01:12:05 +0100] rev 1045
Improve images of the Connectivity section (#411)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 08 Mar 2013 10:47:38 +0100] rev 1044
Greatly extend path_test.cc + fix compiler warning (#408)
Alpar Juttner <alpar@cs.elte.hu> [Sat, 20 Mar 2010 11:03:12 +0100] rev 1043
More tests for radixSort() (#362)
Balazs Dezso <deba@inf.elte.hu> [Fri, 19 Mar 2010 18:23:47 +0100] rev 1042
Bidirectional iterator support for radixSort() (#362)
Alpar Juttner <alpar@cs.elte.hu> [Fri, 01 Mar 2013 18:20:07 +0100] rev 1041
Merge #455
Alpar Juttner <alpar@cs.elte.hu> [Wed, 19 Dec 2012 15:37:12 +0100] rev 1040
Use MathJax for rendering the math formulae (#455)
Alpar Juttner <alpar@cs.elte.hu> [Wed, 19 Dec 2012 15:37:12 +0100] rev 1039
Fix 'make update-external-tags' behavior (#455)
Alpar Juttner <alpar@cs.elte.hu> [Fri, 01 Mar 2013 17:59:08 +0100] rev 1038
Merge #386
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 28 Feb 2013 17:13:14 +0100] rev 1037
Use output iterator instead of a container (#386)
in tourNodes() functions of TSP algorithms
Peter Kovacs <kpeter@inf.elte.hu> [Sun, 09 Jan 2011 15:06:55 +0100] rev 1036
Make InsertionTsp much faster and improve docs (#386)
Peter Kovacs <kpeter@inf.elte.hu> [Sun, 09 Jan 2011 00:57:12 +0100] rev 1035
A detailed test file for TSP algorithms (#386)
Peter Kovacs <kpeter@inf.elte.hu> [Sun, 09 Jan 2011 00:56:52 +0100] rev 1034
Unifications and improvements in TSP algorithms (#386)
Peter Kovacs <kpeter@inf.elte.hu> [Sat, 08 Jan 2011 22:51:16 +0100] rev 1033
Document and greatly improve TSP algorithms (#386)
- Add LEMON headers.
- Add Doxygen doc for all classes and their members.
- Clarify and unify the public API of the algorithms.
- Various small improvements in the implementations to make
them clearer and faster.
- Avoid using adaptors in ChristofidesTsp.
Peter Kovacs <kpeter@inf.elte.hu> [Sat, 08 Jan 2011 22:49:09 +0100] rev 1032
Doc group for TSP algorithms (#386)
Gabor Varga <f4c3@inf.elte.hu> [Sat, 08 Jan 2011 21:59:56 +0100] rev 1031
Heuristic algorithms for symmetric TSP (#386)
Balazs Dezso <deba@google.com> [Tue, 12 Feb 2013 07:15:52 +0100] rev 1030
Changes in BpGraph lgf reader and writer (#69)
- Add typesade RedNode and BlueNode reading and writing
- RedNodes and BlueNodes don't need to have distinct label set
- Add tests
Daniel Poroszkai <poroszd@inf.elte.hu> [Sun, 05 Feb 2012 00:04:44 +0100] rev 1029
Update LGF reader to work with typesafe bipartite node sets (#69)
Balazs Dezso <deba@inf.elte.hu> [Wed, 11 Jan 2012 22:58:05 +0100] rev 1028
Doc fix in BpGraphs (#69)
Balazs Dezso <deba@inf.elte.hu> [Wed, 11 Jan 2012 22:43:50 +0100] rev 1027
Remove asRedBludeNode() function (#69)
Balazs Dezso <deba@inf.elte.hu> [Wed, 11 Jan 2012 22:21:07 +0100] rev 1026
Renamings in BpGraphs (#69)
- RedIt->RedNodeIt
- BlueIt->BlueNodeIt
- RedMap->RedNodeMap
- BlueMap->BlueNodeMap
Balazs Dezso <deba@inf.elte.hu> [Thu, 01 Dec 2011 09:05:47 +0100] rev 1025
Type safe red and blue node set (#69)
Balazs Dezso <deba@inf.elte.hu> [Thu, 25 Nov 2010 22:45:29 +0100] rev 1024
LGF reader and writer for bipartite graphs (#69)
Balazs Dezso <deba@inf.elte.hu> [Tue, 16 Nov 2010 08:19:11 +0100] rev 1023
Use member variables to store the highest IDs in bipartite partitions (#69)
Balazs Dezso <deba@inf.elte.hu> [Tue, 16 Nov 2010 00:59:36 +0100] rev 1022
Implementation of BpGraphCopy (#69)
Balazs Dezso <deba@inf.elte.hu> [Mon, 15 Nov 2010 09:46:08 +0100] rev 1021
ListBpGraph implementation (#69)
Balazs Dezso <deba@inf.elte.hu> [Sun, 14 Nov 2010 22:48:32 +0100] rev 1020
FullBpGraph implementation (#69)
Balazs Dezso <deba@inf.elte.hu> [Sun, 14 Nov 2010 20:06:23 +0100] rev 1019
SmartBpGraph implementation (#69)
Balazs Dezso <deba@inf.elte.hu> [Sun, 14 Nov 2010 16:35:31 +0100] rev 1018
Add bipartite graph concepts (#69)
Alpar Juttner <alpar@cs.elte.hu> [Sun, 24 Feb 2013 19:44:14 +0100] rev 1017
Better Maintainer build type settings (for MSVC)
Alpar Juttner <alpar@cs.elte.hu> [Fri, 22 Feb 2013 16:49:41 +0100] rev 1016
Merge bugfix #445
Alpar Juttner <alpar@cs.elte.hu> [Fri, 20 Jul 2012 21:23:17 +0200] rev 1015
Fix missing initialization in CplexEnv::CplexEnv() (#445)
Alpar Juttner <alpar@cs.elte.hu> [Fri, 22 Feb 2013 14:12:48 +0100] rev 1014
Merge #438 and #436
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 15 Nov 2012 07:17:48 +0100] rev 1013
Ensure strongly polynomial running time for CycleCanceling (#436)
The number of iterations performed by Howard's algorithm is limited.
If the limit is reached, a strongly polynomial implementation,
HartmannOrlinMmc is executed to find a minimum mean cycle.
This iteration limit is typically not reached, thus the combined
method is practically equivalent to Howard's algorithm, while it
also ensures the strongly polynomial time bound.
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 15 Nov 2012 07:05:29 +0100] rev 1012
Optional iteration limit in HowardMmc (#438)
Alpar Juttner <alpar@cs.elte.hu> [Wed, 28 Nov 2012 12:08:47 +0100] rev 1011
Further GCC 4.7 compiler warning fix (#453)
Alpar Juttner <alpar@cs.elte.hu> [Wed, 28 Nov 2012 12:05:27 +0100] rev 1010
Merge bugfix #453
Alpar Juttner <alpar@cs.elte.hu> [Wed, 28 Nov 2012 11:58:00 +0100] rev 1009
Further GCC 4.7 compiler warning fixes (#453)
Alpar Juttner <alpar@cs.elte.hu> [Wed, 28 Nov 2012 11:54:43 +0100] rev 1008
Merge #453 to branches >=1.2
Alpar Juttner <alpar@cs.elte.hu> [Wed, 28 Nov 2012 11:41:40 +0100] rev 1007
Avoid GCC 4.7 compiler warnings (#453)
Alpar Juttner <alpar@cs.elte.hu> [Thu, 08 Nov 2012 09:07:41 +0100] rev 1006
Merge bugfix #440
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 28 Mar 2012 19:39:56 +0200] rev 1005
Fix a bug + remove redundant typedefs in dimacs-solver (#440)
Alpar Juttner <alpar@cs.elte.hu> [Wed, 07 Nov 2012 17:39:39 +0100] rev 1004
Merge docfix #437
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 30 Jan 2012 23:24:40 +0100] rev 1003
Doc improvements for min cost flow algorithms (#437)
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 30 Jan 2012 23:24:14 +0100] rev 1002
Improve module docs and references (#437)
Alpar Juttner <alpar@cs.elte.hu> [Thu, 13 Sep 2012 12:23:46 +0200] rev 1001
Further clang compilation fixes (#449)
Alpar Juttner <alpar@cs.elte.hu> [Thu, 13 Sep 2012 12:13:19 +0200] rev 1000
Merge #449
Alpar Juttner <alpar@cs.elte.hu> [Thu, 13 Sep 2012 12:02:27 +0200] rev 999
Further clang compilation fixes (#449)
Alpar Juttner <alpar@cs.elte.hu> [Thu, 13 Sep 2012 11:56:19 +0200] rev 998
Merge #449 to branches >=1.2
Alpar Juttner <alpar@cs.elte.hu> [Thu, 13 Sep 2012 11:45:36 +0200] rev 997
Fix clang compilation warnings and errors (#449)
Alpar Juttner <alpar@cs.elte.hu> [Wed, 12 Sep 2012 17:34:01 +0200] rev 996
Merge bugfix #448
Alpar Juttner <alpar@cs.elte.hu> [Wed, 12 Sep 2012 17:25:48 +0200] rev 995
Bugfix in adaptor_test.cc (#448)
Alpar Juttner <alpar@cs.elte.hu> [Fri, 24 Aug 2012 16:10:31 +0200] rev 994
Merge bugfix #447
Alpar Juttner <alpar@cs.elte.hu> [Fri, 24 Aug 2012 15:37:23 +0200] rev 993
Bugfix in AllArcLookUp<> (#447)
Alpar Juttner <alpar@cs.elte.hu> [Thu, 22 Dec 2011 20:55:43 +0100] rev 992
Update INSTALL to use CMAKE. Also update AUTHORS and LICENSE
Alpar Juttner <alpar@cs.elte.hu> [Fri, 22 Jun 2012 16:42:05 +0200] rev 991
Merge bugfix #444
Alpar Juttner <alpar@cs.elte.hu> [Fri, 22 Jun 2012 16:25:56 +0200] rev 990
Bugfix in path copy constructors and assignment operators (#444)
Alpar Juttner <alpar@cs.elte.hu> [Sun, 06 May 2012 17:18:39 +0200] rev 989
Merge bugfix #441
Alpar Juttner <alpar@cs.elte.hu> [Sat, 05 May 2012 10:22:44 +0200] rev 988
Fix buggy reinitialization in _solver_bits::VarIndex::clear() (#441)
- In addition, rows.clear() and cols.clear() are moved up to LpBase::clear()
Alpar Juttner <alpar@cs.elte.hu> [Fri, 03 Feb 2012 05:55:39 +0100] rev 987
Merge
Alpar Juttner <alpar@cs.elte.hu> [Fri, 03 Feb 2012 05:55:01 +0100] rev 986
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 30 Jan 2012 19:29:03 +0100] rev 985
Fix the doc in CapacityScaling: cost can be real numbers (#261)
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 30 Jan 2012 20:21:45 +0100] rev 984
Improve the Altering List pivot rule for NetworkSimplex (#435)
Much less candidate arcs are preserved from an iteration to the
next one and partial_sort() is used instead of heap operations.
Alpar Juttner <alpar@cs.elte.hu> [Wed, 01 Feb 2012 06:43:50 +0100] rev 983
Add dist target to CMAKE conf. (#434)
Alpar Juttner <alpar@cs.elte.hu> [Mon, 30 Jan 2012 17:49:50 +0100] rev 982
Use hg templating instead of scripts/chg-len.py (#434)
Alpar Juttner <alpar@cs.elte.hu> [Mon, 30 Jan 2012 10:54:49 +0100] rev 981
Remove autotool related files (#434)
Alpar Juttner <alpar@cs.elte.hu> [Sun, 29 Jan 2012 22:33:14 +0100] rev 980
LEMON_THREADING cmake variable for choosing threading lib (#223)
Balazs Dezso <deba@inf.elte.hu> [Sun, 29 Jan 2012 11:28:41 +0100] rev 979
Thread safe map construction and destruction (#223)
It currently support pthread and windows threads.
Alpar Juttner <alpar@cs.elte.hu> [Fri, 20 Jan 2012 19:08:00 +0100] rev 978
GCC 3.3 compatibility fix in nagamochi_ibaraki.h
Alpar Juttner <alpar@cs.elte.hu> [Thu, 19 Jan 2012 15:25:06 +0100] rev 977
Intel C++ compatibility fix in max_cardinality_search.h
Alpar Juttner <alpar@cs.elte.hu> [Fri, 20 Jan 2012 19:23:48 +0100] rev 976
Merge Intel C++ compatibility fixes
Alpar Juttner <alpar@cs.elte.hu> [Thu, 19 Jan 2012 15:25:06 +0100] rev 975
Intel C++ compatibility fixes
Alpar Juttner <alpar@cs.elte.hu> [Wed, 11 Jan 2012 14:12:36 +0100] rev 974
Merge LP interface updates
Alpar Juttner <alpar@cs.elte.hu> [Fri, 06 Jan 2012 16:27:06 +0100] rev 973
Make CBC interface compatible with latest CBC releases
CBC now uses the CLP backend unconditionally
Alpar Juttner <alpar@cs.elte.hu> [Sat, 24 Dec 2011 01:15:59 +0100] rev 972
Update CPLEX lookup
- References to explicit CPLEX version 9.1 have been removed
- Library file name must either be 'cplex.a' or 'cplex.dll'
Alpar Juttner <alpar@cs.elte.hu> [Tue, 20 Dec 2011 19:43:58 +0100] rev 971
Merge #432 and #433
Alpar Juttner <alpar@cs.elte.hu> [Tue, 20 Dec 2011 19:31:44 +0100] rev 970
Add missing doc/references.bib to release tarball (#432)
Alpar Juttner <alpar@cs.elte.hu> [Tue, 20 Dec 2011 19:35:47 +0100] rev 969
Merge
Alpar Juttner <alpar@cs.elte.hu> [Tue, 20 Dec 2011 19:33:51 +0100] rev 968
Support shared library build (#433)
Alpar Juttner <alpar@cs.elte.hu> [Tue, 20 Dec 2011 19:21:08 +0100] rev 967
Add missing doc/template.h to release tarball (#432)
Alpar Juttner <alpar@cs.elte.hu> [Tue, 20 Dec 2011 19:25:40 +0100] rev 966
Merge head merging
Alpar Juttner <alpar@cs.elte.hu> [Tue, 20 Dec 2011 18:15:38 +0100] rev 965
Merge
Alpar Juttner <alpar@cs.elte.hu> [Tue, 20 Dec 2011 18:15:14 +0100] rev 964
Merge
Alpar Juttner <alpar@cs.elte.hu> [Tue, 20 Dec 2011 17:44:38 +0100] rev 963
Merge
Alpar Juttner <alpar@cs.elte.hu> [Tue, 20 Dec 2011 17:43:11 +0100] rev 962
Merge
Alpar Juttner <alpar@cs.elte.hu> [Tue, 20 Dec 2011 17:38:19 +0100] rev 961
Merge
Alpar Juttner <alpar@cs.elte.hu> [Tue, 20 Dec 2011 17:36:41 +0100] rev 960
Merge
Alpar Juttner <alpar@cs.elte.hu> [Tue, 20 Dec 2011 17:35:45 +0100] rev 959
Merge
Alpar Juttner <alpar@cs.elte.hu> [Tue, 01 Nov 2011 13:59:35 +0100] rev 958
Merge bugfix #430
Gabor Retvari <retvari@tmit.bme.hu> [Tue, 01 Nov 2011 08:24:30 +0100] rev 957
Fix LpBase::Constr two-side limit bug (#430)
Alpar Juttner <alpar@cs.elte.hu> [Mon, 24 Oct 2011 21:42:22 +0200] rev 956
Merge #428 and #429
Peter Kovacs <kpeter@inf.elte.hu> [Sun, 23 Oct 2011 22:42:14 +0200] rev 955
Fix windows-specific compilation error (#429)
Peter Kovacs <kpeter@inf.elte.hu> [Sun, 23 Oct 2011 22:49:04 +0200] rev 954
Fix VS warnings (#429)
Alpar Juttner <alpar@cs.elte.hu> [Wed, 05 Oct 2011 12:02:56 +0200] rev 953
Add lemon/lemon.pc.cmake to the release tarball (#428)
Alpar Juttner <alpar@cs.elte.hu> [Thu, 04 Aug 2011 22:03:49 +0200] rev 952
Merge AUTHORS file update
Alpar Juttner <alpar@cs.elte.hu> [Thu, 04 Aug 2011 22:00:57 +0200] rev 951
Update the AUTHORS file
Alpar Juttner <alpar@cs.elte.hu> [Thu, 04 Aug 2011 21:47:29 +0200] rev 950
Merge #382
Alpar Juttner <alpar@cs.elte.hu> [Tue, 02 Aug 2011 18:13:34 +0200] rev 949
Allow lgf file without Arc maps (#382)
A single '-' character in the @arcs sectio header indicates that
there is no arc map.
Alpar Juttner <alpar@cs.elte.hu> [Wed, 13 Jul 2011 15:04:03 +0200] rev 948
Merge #419
Alpar Juttner <alpar@cs.elte.hu> [Wed, 13 Jul 2011 14:38:50 +0200] rev 947
Do not look for COIN_VOL libraries
Alpar Juttner <alpar@cs.elte.hu> [Fri, 15 Apr 2011 09:40:17 +0200] rev 946
Also search for coin libs under ${COIN_ROOT_DIR}/lib/coin (#419)
Alpar Juttner <alpar@cs.elte.hu> [Fri, 15 Apr 2011 09:37:47 +0200] rev 945
Build of mip_test and lp_test precede the running of the tests (#419)
Alpar Juttner <alpar@cs.elte.hu> [Fri, 15 Apr 2011 09:26:09 +0200] rev 944
Merge GLPK fix #337 with CMAKE improvements
Alpar Juttner <alpar@cs.elte.hu> [Tue, 26 Apr 2011 17:25:00 +0200] rev 943
Merge bugfix #420
Balazs Dezso <deba@inf.elte.hu> [Sun, 24 Apr 2011 21:59:31 +0200] rev 942
Fix IterableValueMap (#420)
Alpar Juttner <alpar@cs.elte.hu> [Tue, 12 Apr 2011 08:04:04 +0200] rev 941
Merge #418
Alpar Juttner <alpar@cs.elte.hu> [Thu, 07 Apr 2011 16:57:35 +0200] rev 940
Better Win CodeBlock/MinGW support (#418)
- Remove -ansi compilation flag
- Don't include sys/times.h when WIN32 is defined
Alpar Juttner <alpar@cs.elte.hu> [Thu, 17 Mar 2011 18:12:03 +0100] rev 939
Merge #416
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 15 Mar 2011 19:54:11 +0100] rev 938
Change the default scaling factor in CostScaling (#417)
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 15 Mar 2011 19:52:31 +0100] rev 937
Faster computation of the dual solution in CostScaling (#417)
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 15 Mar 2011 19:32:21 +0100] rev 936
Implement the scaling Price Refinement heuristic in CostScaling (#417)
instead of Early Termination.
These two heuristics are similar, but the newer one is faster
and not only makes it possible to skip some epsilon phases, but
it can improve the performance of the other phases, as well.
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 15 Mar 2011 19:16:20 +0100] rev 935
Fix and improve refine methods in CostScaling (#417)
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 15 Mar 2011 17:59:57 +0100] rev 934
Minor improvements in CostScaling (#417)
Alpar Juttner <alpar@cs.elte.hu> [Mon, 14 Mar 2011 08:56:54 +0100] rev 933
Support tests with valgrind (#416)
Alpar Juttner <alpar@cs.elte.hu> [Thu, 17 Mar 2011 09:02:51 +0100] rev 932
Merge #417
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 17 Mar 2011 00:35:33 +0100] rev 931
Bug fix in CostScaling (#417)
Alpar Juttner <alpar@cs.elte.hu> [Fri, 04 Mar 2011 12:18:38 +0100] rev 930
Merge #404
Alpar Juttner <alpar@cs.elte.hu> [Fri, 04 Mar 2011 10:31:12 +0100] rev 929
Remove doc header (show version number on the main page) (#404)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 21 Jan 2011 22:04:22 +0100] rev 928
Update Doxygen config files + enable search (#404)
Alpar Juttner <alpar@cs.elte.hu> [Wed, 25 Aug 2010 21:34:58 +0200] rev 927
Backport the CMAKE related changesets from the main branch
[e20fecd1945f] Add check target for CMake (#388)
[e74b5db4f2c6] Put the output of chg-len.py in the version string (#389)
[7d166b8b8018] Safer call of ./scripts/chg-len.py on Windows (#389)
[659ba4805a48] Make CMAKE config more consistent with configure.ac (#390)
[63e4468c680e] Add 'Maintainer' CMAKE build type (#388, #390)
[a725503acfe9] Allow CPACK configuration on all platforms
[10242c611190] Create and install lemon.pc (#393)
[48e29534cf03] The deafult target doesn't build lp_test and mip_test (#388)
[0fbbdd578c06] Full path for DoxygenLayout.xml in Doxyfile.in (#395)
[481496e6d71f] SOURCE_BROWSER Doxygen switch is configurable from CMAKE (#395)
[09282720100b] update-external-tags CMAKE target (#395)
Alpar Juttner <alpar@cs.elte.hu> [Sat, 10 Oct 2009 08:19:26 +0200] rev 926
Backport [53bea38f71cb] 'Update Doxygen configuration file'
Alpar Juttner <alpar@cs.elte.hu> [Fri, 03 Dec 2010 13:26:38 +0100] rev 925
Add contrib dir (#401)
Alpar Juttner <alpar@cs.elte.hu> [Mon, 28 Feb 2011 10:19:34 +0100] rev 924
Merge bugfix #414
Alpar Juttner <alpar@cs.elte.hu> [Fri, 25 Feb 2011 21:37:47 +0100] rev 923
Fix wrong initialization in Preflow (#414)
Alpar Juttner <alpar@cs.elte.hu> [Mon, 10 Jan 2011 09:34:50 +0100] rev 922
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Sat, 08 Jan 2011 16:11:48 +0100] rev 921
Minor doc improvements
Peter Kovacs <kpeter@inf.elte.hu> [Sun, 09 Jan 2011 23:20:56 +0100] rev 920
Improve the doc of path structures (#406)
Peter Kovacs <kpeter@inf.elte.hu> [Sun, 09 Jan 2011 16:51:14 +0100] rev 919
Various doc improvements (#406)
Peter Kovacs <kpeter@inf.elte.hu> [Sat, 08 Jan 2011 15:52:07 +0100] rev 918
Various search limits for the max clique alg (#405)
Alpar Juttner <alpar@cs.elte.hu> [Tue, 16 Nov 2010 07:46:01 +0100] rev 917
Merge
Antal Nemes <thoneyvazul@gmail.com> [Mon, 15 Nov 2010 22:23:35 +0100] rev 916
Port max. card. search alg. from svn -r3512 (#397) and (#56)
Alpar Juttner <alpar@cs.elte.hu> [Mon, 15 Nov 2010 08:45:12 +0100] rev 915
Doc improvements in HaoOrlin (#398)
Alpar Juttner <alpar@cs.elte.hu> [Mon, 15 Nov 2010 07:52:53 +0100] rev 914
Merge
Balazs Dezso <deba@inf.elte.hu> [Sun, 14 Nov 2010 09:25:03 +0100] rev 913
New implementation for Nagamochi-Ibaraki algorithm
Alpar Juttner <alpar@cs.elte.hu> [Mon, 25 Oct 2010 16:49:39 +0200] rev 912
update-external-tags CMAKE target (#395)
Alpar Juttner <alpar@cs.elte.hu> [Mon, 25 Oct 2010 15:33:57 +0200] rev 911
SOURCE_BROWSER Doxygen switch is configurable from CMAKE (#395)
Alpar Juttner <alpar@cs.elte.hu> [Mon, 25 Oct 2010 13:37:06 +0200] rev 910
Full path for DoxygenLayout.xml in Doxyfile.in (#395)
Alpar Juttner <alpar@cs.elte.hu> [Wed, 27 Oct 2010 12:30:59 +0200] rev 909
The deafult target doesn't build lp_test and mip_test (#388)
Alpar Juttner <alpar@cs.elte.hu> [Sun, 26 Sep 2010 16:17:33 +0200] rev 908
Create and install lemon.pc (#393)
Alpar Juttner <alpar@cs.elte.hu> [Wed, 22 Sep 2010 09:38:23 +0200] rev 907
Merge bugfix #392
Alpar Juttner <alpar@cs.elte.hu> [Wed, 22 Sep 2010 08:53:09 +0200] rev 906
Bug fix in Dfs::start(s,t) (#392)
Alpar Juttner <alpar@cs.elte.hu> [Sun, 12 Sep 2010 08:32:46 +0200] rev 905
Merge #380
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 23 Jul 2010 06:29:37 +0200] rev 904
Add a heuristic algorithm for the max clique problem (#380)
Alpar Juttner <alpar@cs.elte.hu> [Sun, 12 Sep 2010 07:02:51 +0200] rev 903
Merge CMAKE config improvements (#388, #389, #390)
Alpar Juttner <alpar@cs.elte.hu> [Sat, 11 Sep 2010 09:31:06 +0200] rev 902
Allow CPACK configuration on all platforms
Alpar Juttner <alpar@cs.elte.hu> [Fri, 10 Sep 2010 12:04:38 +0200] rev 901
Add 'Maintainer' CMAKE build type (#388, #390)
- some extra warning and debug options
- build stops on warning (-Werror)
- tests are built and run by default
Alpar Juttner <alpar@cs.elte.hu> [Thu, 09 Sep 2010 15:55:00 +0200] rev 900
Make CMAKE config more consistent with configure.ac (#390)
- CMAKE_BUILD_TYPE is Release by deafult
- The same set of warnings are used when compiling with gcc
Alpar Juttner <alpar@cs.elte.hu> [Fri, 03 Sep 2010 15:37:19 +0200] rev 899
Safer call of ./scripts/chg-len.py on Windows (#389)
Still hard to get it worked properly by user. It needs
- a python interpreter in the exec path
- the mercurial modules accessible by this interpreter
Akos Ladanyi <ladanyi@tmit.bme.hu> [Wed, 25 Aug 2010 22:02:40 +0200] rev 898
Put the output of chg-len.py in the version string (#389)
Akos Ladanyi <ladanyi@tmit.bme.hu> [Wed, 25 Aug 2010 21:34:58 +0200] rev 897
Add check target for CMake (#388)
Peter Kovacs <kpeter@inf.elte.hu> [Sat, 04 Sep 2010 23:58:03 +0200] rev 896
Improve arc mixing in NS and enable it by default (#391)
Peter Kovacs <kpeter@inf.elte.hu> [Sun, 22 Aug 2010 23:54:10 +0200] rev 895
Improve the tree update process and a pivot rule (#391)
and make some parts of the code clearer using better names
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 22 Jun 2010 16:13:00 +0200] rev 894
Improve graph_copy_test.cc
Alpar Juttner <alpar@cs.elte.hu> [Fri, 25 Jun 2010 06:41:55 +0200] rev 893
Merge bugfix #371
Alpar Juttner <alpar@cs.elte.hu> [Fri, 25 Jun 2010 06:00:56 +0200] rev 892
Merge bugfix #372
Balazs Dezso <deba@inf.elte.hu> [Thu, 24 Jun 2010 09:27:53 +0200] rev 891
Fix critical bug in preflow (#372)
The wrong transition between the bound decrease and highest active
heuristics caused the bug. The last node chosen in bound decrease mode
is used in the first iteration in highest active mode.
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 22 Jun 2010 15:39:26 +0200] rev 890
Bug fix in (di)graphCopy() (#371)
The target graph is cleared before adding nodes and arcs/edges.
Alpar Juttner <alpar@cs.elte.hu> [Mon, 03 May 2010 10:56:24 +0200] rev 889
Merge bugfix #368
Peter Kovacs <kpeter@inf.elte.hu> [Sun, 02 May 2010 18:53:56 +0200] rev 888
Fix the usage of min() (#368)
Alpar Juttner <alpar@cs.elte.hu> [Mon, 12 Apr 2010 17:05:49 +0200] rev 887
Merge bugfix #366
Balazs Dezso <deba@inf.elte.hu> [Mon, 12 Apr 2010 13:59:41 +0200] rev 886
Fix PredMatrixMapPath::empty() (#366)
Gabor Retvari <retvari@tmit.bme.hu> [Sun, 11 Apr 2010 22:28:42 +0200] rev 885
Fix PredMapPath::empty() (#366)
Alpar Juttner <alpar@cs.elte.hu> [Tue, 06 Apr 2010 07:04:38 +0200] rev 884
Merge bugfix #364
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 05 Apr 2010 23:41:05 +0200] rev 883
Add an undirected() function (#364)
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 05 Apr 2010 23:33:57 +0200] rev 882
Add missing UndirectedTags (#364)
Alpar Juttner <alpar@cs.elte.hu> [Wed, 17 Mar 2010 14:05:23 +0100] rev 881
Update NEWS file
Alpar Juttner <alpar@cs.elte.hu> [Thu, 18 Mar 2010 14:17:03 +0100] rev 880
Merge backout of a6eb9698c321 (#360,#51)
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 18 Mar 2010 00:30:25 +0100] rev 879
Small doc fixes and improvements (#359)
Alpar Juttner <alpar@cs.elte.hu> [Thu, 18 Mar 2010 13:18:58 +0100] rev 878
Backed out changeset a6eb9698c321 (#360, #51)
Alpar Juttner <alpar@cs.elte.hu> [Sat, 06 Mar 2010 14:35:12 +0000] rev 877
Unify the sources (#339)
Balazs Dezso <deba@inf.elte.hu> [Wed, 17 Mar 2010 12:35:52 +0100] rev 876
Fix multiple executions in matchings (fract. mathcings) (#356)
Alpar Juttner <alpar@cs.elte.hu> [Wed, 17 Mar 2010 10:29:57 +0100] rev 875
Merge #356
Alpar Juttner <alpar@cs.elte.hu> [Tue, 16 Mar 2010 21:27:35 +0100] rev 874
Merge #314
Alpar Juttner <alpar@cs.elte.hu> [Tue, 16 Mar 2010 21:18:39 +0100] rev 873
Minor doc fix related to #348
Balazs Dezso <deba@inf.elte.hu> [Thu, 04 Mar 2010 15:20:59 +0100] rev 872
Uniforming primal scale to 2 (#314)
Balazs Dezso <deba@inf.elte.hu> [Thu, 04 Mar 2010 10:17:02 +0100] rev 871
Fix documentation issues (#314)
Balazs Dezso <deba@inf.elte.hu> [Sat, 26 Sep 2009 10:17:31 +0200] rev 870
Fractional matching initialization of weighted matchings (#314)
Balazs Dezso <deba@inf.elte.hu> [Fri, 25 Sep 2009 21:51:36 +0200] rev 869
Add fractional matching algorithms (#314)
Balazs Dezso <deba@inf.elte.hu> [Sun, 20 Sep 2009 21:38:24 +0200] rev 868
General improvements in weighted matching algorithms (#314)
- Fix include guard
- Uniform handling of MATCHED and UNMATCHED blossoms
- Prefer operations which decrease the number of trees
- Fix improper use of '/='
The solved problems did not cause wrong solution.
Balazs Dezso <deba@inf.elte.hu> [Tue, 16 Mar 2010 21:12:10 +0100] rev 867
Fix multiple execution bug in weighted matchings (#356)
This chgset also redoes the fix of [28c7ad6f8d91] and its backpont to 1.1,
[268a052c3043].
Alpar Juttner <alpar@cs.elte.hu> [Sun, 14 Mar 2010 09:14:05 +0100] rev 866
Add doc/references.dox to .hgignore
Alpar Juttner <alpar@cs.elte.hu> [Sun, 14 Mar 2010 09:13:04 +0100] rev 865
Replace figure at matching doc #348
The original bibartite_matching.eps is kept for future use.
Peter Kovacs <kpeter@inf.elte.hu> [Sat, 13 Mar 2010 22:01:38 +0100] rev 864
Rename min mean cycle classes and their members (#179)
with respect to the possible introduction of min ratio
cycle algorithms in the future.
The renamed classes:
- Karp --> KarpMmc
- HartmannOrlin --> HartmannOrlinMmc
- Howard --> HowardMmc
The renamed members:
- cycleLength() --> cycleCost()
- cycleArcNum() --> cycleSize()
- findMinMean() --> findCycleMean()
- Value --> Cost
- LargeValue --> LargeCost
- SetLargeValue --> SetLargeCost
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 08 Mar 2010 08:33:41 +0100] rev 863
Fix gcc 3.3 compilation error (#354)
gcc 3.3 requires that a class has a default constructor if it has
template named parameters. (That constructor can be protected.)
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 04 Mar 2010 10:03:14 +0100] rev 862
Clarify type names in NetworkSimplex (#353)
This patch clarifies the misleading effects of the renamings
in [f3bc4e9b5f3a].
Alpar Juttner <alpar@cs.elte.hu> [Wed, 03 Mar 2010 20:48:29 +0000] rev 861
Merge #306
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 02 Mar 2010 10:03:07 +0100] rev 860
Add tolerance() functions for HaoOrlin (#306)
Alpar Juttner <alpar@cs.elte.hu> [Wed, 03 Mar 2010 17:22:13 +0000] rev 859
Merge #301
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 02 Mar 2010 10:27:47 +0100] rev 858
Also test fullInit() in suurballe_test (#181, #323)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 16 Oct 2009 09:35:46 +0200] rev 857
Add traits class + named parameters to Suurballe (#323)
The following types can be modified using named parameters:
- FlowMap
- PotentialMap
- Path
- Heap + HeapCrossRef
Alpar Juttner <alpar@cs.elte.hu> [Wed, 03 Mar 2010 17:14:17 +0000] rev 856
Merge #181, #323
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 29 Sep 2009 13:32:01 +0200] rev 855
Rename heap structures (#301)
- KaryHeap --> DHeap
- FouraryHeap --> QuadHeap
- BinomHeap --> BinomialHeap
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 16 Oct 2009 02:32:30 +0200] rev 854
Add a fullInit() function to Suurballe (#181, #323)
to provide faster handling of multiple targets.
A start() function is also added, just for the sake of
convenience.
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 16 Oct 2009 01:06:16 +0200] rev 853
Rework and improve Suurballe (#323)
- Improve the implementation: use a specific, faster variant of
residual Dijkstra for the first search.
- Some reorganizatiopn to make the code simpler.
- Small doc improvements.
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 15 Oct 2009 21:04:50 +0200] rev 852
Remove unnecessary integer requirement in Suurballe (#323)
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 15 Oct 2009 21:03:17 +0200] rev 851
Bug fix in Suurballe (#323)
Alpar Juttner <alpar@cs.elte.hu> [Mon, 01 Mar 2010 07:51:45 +0100] rev 850
Configurable glpk prefix in ./scripts/bootstrap.sh and ...
unneeded solver backends are explicitely switched off with --without-*
Alpar Juttner <alpar@cs.elte.hu> [Sun, 28 Feb 2010 20:52:08 +0100] rev 849
Merge #342
Peter Kovacs <kpeter@inf.elte.hu> [Sun, 14 Feb 2010 19:06:07 +0100] rev 848
Improve README and mainpage.dox (#342)
Alpar Juttner <alpar@cs.elte.hu> [Sun, 28 Feb 2010 19:58:24 +0100] rev 847
Merge #347
Peter Kovacs <kpeter@inf.elte.hu> [Sat, 20 Feb 2010 16:51:43 +0100] rev 846
Use 'long long' flow cost in dimacs-solver.cc (#347)
Alpar Juttner <alpar@cs.elte.hu> [Sun, 28 Feb 2010 19:38:29 +0100] rev 845
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 19 Feb 2010 14:08:32 +0100] rev 844
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.
Alpar Juttner <alpar@cs.elte.hu> [Sun, 28 Feb 2010 19:23:01 +0100] rev 843
Merge #332
Alpar Juttner <alpar@cs.elte.hu> [Sun, 14 Feb 2010 19:23:55 +0100] rev 842
ArgParser can throw exception instead of exit(1) (#332)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 26 Feb 2010 23:53:09 +0100] rev 841
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.
Alpar Juttner <alpar@cs.elte.hu> [Fri, 26 Feb 2010 14:00:20 +0100] rev 840
Merge #340
Peter Kovacs <kpeter@inf.elte.hu> [Sat, 20 Feb 2010 18:39:03 +0100] rev 839
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.
Alpar Juttner <alpar@cs.elte.hu> [Sun, 21 Feb 2010 18:55:30 +0100] rev 838
Merge bugfix #336
Alpar Juttner <alpar@cs.elte.hu> [Thu, 11 Feb 2010 10:02:11 +0100] rev 837
Fix the date field comment of graphToEps() output (#336)
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 17 Feb 2010 23:10:36 +0100] rev 836
Modify the header of scripts/bib2dox.py (#184)
Alpar Juttner <alpar@cs.elte.hu> [Mon, 15 Feb 2010 09:03:11 +0100] rev 835
Merge
Balazs Dezso <deba@inf.elte.hu> [Thu, 10 Dec 2009 09:09:08 +0100] rev 834
Fix LpBase::addRow(Constr) (#334)
Balazs Dezso <deba@inf.elte.hu> [Sun, 14 Feb 2010 23:14:09 +0100] rev 833
Merge bugfix #337
Balazs Dezso <deba@inf.elte.hu> [Sun, 14 Feb 2010 23:10:24 +0100] rev 832
Use void* like LPX object (#337)
Alpar Juttner <alpar@cs.elte.hu> [Fri, 12 Feb 2010 22:24:26 +0100] rev 831
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 10 Feb 2010 19:05:20 +0100] rev 830
Handle graph changes in the MCF algorithms (#327)
The reset() functions are renamed to resetParams() and the new reset()
functions handle the graph chnages, as well.
Alpar Juttner <alpar@cs.elte.hu> [Fri, 12 Feb 2010 22:17:20 +0100] rev 829
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 11 Feb 2010 07:40:29 +0100] rev 828
Doc improvements for planarity related tools (#62)
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 11 Feb 2010 07:39:57 +0100] rev 827
Port planar image from SVN -r3524 (#62)
Alpar Juttner <alpar@cs.elte.hu> [Fri, 12 Feb 2010 21:53:15 +0100] rev 826
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 12 Feb 2010 11:00:20 +0100] rev 825
Add doc for the traits class parameters (#315)
Akos Ladanyi <ladanyi@tmit.bme.hu> [Thu, 11 Feb 2010 16:55:54 +0000] rev 824
Add more information on Makefile variables (#316)
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 09 Feb 2010 23:29:51 +0100] rev 823
Add a warning about huge capacities in Preflow (#319)
Alpar Juttner <alpar@cs.elte.hu> [Mon, 14 Dec 2009 06:07:52 +0100] rev 822
Merge #180 and a bugfix in #51
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 13 Nov 2009 00:39:28 +0100] rev 821
Small bug fixes (#180)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 13 Nov 2009 00:37:55 +0100] rev 820
Rename a private type in MCF classes (#180)
The new MCF algorithms define a private map type VectorMap,
which could be misleading, since there is an other VectorMap
defined in lemon/bits/vector_map.h. Thus the new type is
is renamed to StaticVectorMap.
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 13 Nov 2009 00:24:39 +0100] rev 819
Adds tests for the new MCF algorithms (#180)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 13 Nov 2009 00:23:07 +0100] rev 818
Rework the MCF test file to help extending it (#180)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 13 Nov 2009 00:15:50 +0100] rev 817
Fixes in the heap concept to avoid warnings (#180)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 13 Nov 2009 00:11:11 +0100] rev 816
Add citations to CycleCanceling (#180, #184)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 13 Nov 2009 00:10:33 +0100] rev 815
Entirely rework cycle canceling algorithms (#180)
- Move the cycle canceling algorithms (CycleCanceling, CancelAndTighten)
into one class (CycleCanceling).
- Add a Method parameter to the run() function to be able to select
the used cycle canceling method.
- Use the new interface similarly to NetworkSimplex.
- Rework the implementations using an efficient internal structure
for handling the residual network.
This improvement made the codes much faster.
- Handle GEQ supply type (LEQ is not supported).
- Handle infinite upper bounds.
- Handle negative costs (for arcs of finite upper bound).
- Extend the documentation.
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 13 Nov 2009 00:09:35 +0100] rev 814
Port cycle canceling algorithms from SVN -r3524 (#180)
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 12 Nov 2009 23:52:51 +0100] rev 813
Add citations to the scaling MCF algorithms (#180, #184)
and improve the doc of their group.
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 12 Nov 2009 23:49:05 +0100] rev 812
Small doc improvements + unifications in MCF classes (#180)
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 12 Nov 2009 23:45:15 +0100] rev 811
Small implementation improvements in MCF algorithms (#180)
- Handle max() as infinite value (not only infinity()).
- Better GEQ handling in CapacityScaling.
- Skip the unnecessary saturating operations in the first phase in
CapacityScaling.
- Use vector<char> instead of vector<bool> and vector<int> if it is
possible and it proved to be usually faster.
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 12 Nov 2009 23:34:35 +0100] rev 810
More options for run() in scaling MCF algorithms (#180)
- Three methods can be selected and the scaling factor can be
given for CostScaling.
- The scaling factor can be given for CapacityScaling.
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 12 Nov 2009 23:30:45 +0100] rev 809
Entirely rework CostScaling (#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.
- Handle GEQ supply type (LEQ is not supported).
- Handle infinite upper bounds.
- Handle negative costs (for arcs of finite upper bound).
- Traits class + named parameter for the LargeCost type used in
internal computations.
- Extend the documentation.
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 12 Nov 2009 23:29:42 +0100] rev 808
Port CostScaling from SVN -r3524 (#180)
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 12 Nov 2009 23:27:21 +0100] rev 807
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 806
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 805
Port CapacityScaling from SVN -r3524 (#180)
Peter Kovacs <kpeter@inf.elte.hu> [Sun, 13 Dec 2009 22:19:08 +0100] rev 804
Memory leak bugfix in BellmanFord (#51)
Alpar Juttner <alpar@cs.elte.hu> [Thu, 10 Dec 2009 17:18:25 +0100] rev 803
Merge bugfix #330
Alpar Juttner <alpar@cs.elte.hu> [Thu, 10 Dec 2009 17:05:35 +0100] rev 802
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 13 Nov 2009 12:33:33 +0100] rev 801
Bug fix in map_extender.h (#330)
Balazs Dezso <deba@inf.elte.hu> [Thu, 10 Dec 2009 09:14:47 +0100] rev 800
Fix clear() function in ExtendFindEnum (#335)
Alpar Juttner <alpar@cs.elte.hu> [Wed, 09 Dec 2009 11:14:06 +0100] rev 799
Merge #62
Balazs Dezso <deba@inf.elte.hu> [Sun, 04 Oct 2009 10:15:32 +0200] rev 798
Planarity checking function instead of class (#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)
Alpar Juttner <alpar@cs.elte.hu> [Fri, 20 Nov 2009 14:18:33 +0100] rev 796
Merge
Balazs Dezso <deba@inf.elte.hu> [Wed, 18 Nov 2009 21:21:26 +0100] rev 795
Fix in HartmannOrlin algorithm (#333)
Alpar Juttner <alpar@cs.elte.hu> [Thu, 19 Nov 2009 09:36:43 +0100] rev 794
Valgring option for ./scripts/bootstrap.sh
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
Alpar Juttner <alpar@cs.elte.hu> [Wed, 18 Nov 2009 14:38:38 +0100] rev 792
Merge
Alpar Juttner <alpar@cs.elte.hu> [Wed, 18 Nov 2009 14:22:52 +0100] rev 791
Merge
Alpar Juttner <alpar@cs.elte.hu> [Wed, 18 Nov 2009 14:21:35 +0100] rev 790
Fix gcc-4.4 compilation warning
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 13 Nov 2009 12:47:13 +0100] rev 789
Map utility functions (#320)
Alpar Juttner <alpar@cs.elte.hu> [Wed, 18 Nov 2009 14:38:02 +0100] rev 788
Merge
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.
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 13 Nov 2009 18:10:06 +0100] rev 786
Small doc fixes in several files (#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)
Alpar Juttner <alpar@cs.elte.hu> [Thu, 05 Nov 2009 15:50:01 +0100] rev 784
Merge #321
Alpar Juttner <alpar@cs.elte.hu> [Thu, 05 Nov 2009 15:48:01 +0100] rev 783
Merge #293
Alpar Juttner <alpar@cs.elte.hu> [Thu, 05 Nov 2009 10:27:17 +0100] rev 782
Merge
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.
Alpar Juttner <alpar@cs.elte.hu> [Thu, 05 Nov 2009 10:23:16 +0100] rev 780
Merge #68 (Port static graph implementation)
Alpar Juttner <alpar@cs.elte.hu> [Thu, 05 Nov 2009 10:01:02 +0100] rev 779
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 29 Sep 2009 13:03:34 +0200] rev 778
Make some graph member functions static (#311, #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.
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.
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 25 Aug 2009 16:32:47 +0200] rev 775
Add documentation 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)
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 25 Aug 2009 11:09:02 +0200] rev 773
Port StaticDigraph from SVN -r3524 (#68)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 16 Oct 2009 09:50:18 +0200] rev 772
Small fix in the doc (#179)
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)
Alpar Juttner <alpar@cs.elte.hu> [Thu, 05 Nov 2009 08:39:49 +0100] rev 770
Merge #179 (Port the min mean cycle algorithms)
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 18 Aug 2009 10:08:28 +0200] rev 769
Add tolerance() functions for MMC 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)
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.
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.
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.
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 10 Aug 2009 14:50:57 +0200] rev 764
Rename MinMeanCycle to Howard (#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)
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 06 Aug 2009 20:31:04 +0200] rev 762
Rename cyclePath() to cycle() in 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).
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.
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().
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
Alpar Juttner <alpar@cs.elte.hu> [Thu, 05 Nov 2009 06:26:18 +0100] rev 757
Merge #184
Peter Kovacs <kpeter@inf.elte.hu> [Sat, 10 Oct 2009 08:19:26 +0200] rev 756
Update Doxygen configuration file
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.
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.
Alpar Juttner <alpar@cs.elte.hu> [Mon, 12 Oct 2009 17:02:03 +0100] rev 753
Merge bugfix #322
Akos Ladanyi <ladanyi@tmit.bme.hu> [Mon, 12 Oct 2009 16:37:22 +0100] rev 752
Distribute LEMONConfig.cmake.in (#322)
Alpar Juttner <alpar@cs.elte.hu> [Mon, 12 Oct 2009 15:37:13 +0100] rev 751
Merge bugfix in #250
Alpar Juttner <alpar@cs.elte.hu> [Mon, 05 Oct 2009 20:21:54 +0200] rev 750
Merge #317
Balazs Dezso <deba@inf.elte.hu> [Wed, 30 Sep 2009 11:17:00 +0200] rev 749
Remove unnecessary OsiCbc dependency (#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)
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.
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
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 02 Oct 2009 17:03:43 +0200] rev 745
Improve bib2dox.py using \section for entiries (#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)
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)
Alpar Juttner <alpar@cs.elte.hu> [Wed, 30 Sep 2009 08:41:06 +0200] rev 742
Merge #311
Alpar Juttner <alpar@cs.elte.hu> [Wed, 30 Sep 2009 08:36:43 +0200] rev 741
Merge
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
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.
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.
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.
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.
Peter Kovacs <kpeter@inf.elte.hu> [Sun, 23 Aug 2009 11:09:22 +0200] rev 735
Doc improvements, fixes and unifications for graphs (#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)
Alpar Juttner <alpar@cs.elte.hu> [Tue, 29 Sep 2009 09:25:23 +0200] rev 733
Copyright notices added to scripts
Alpar Juttner <alpar@cs.elte.hu> [Tue, 29 Sep 2009 09:25:00 +0200] rev 732
Simple interactive bootstrap script
Alpar Juttner <alpar@cs.elte.hu> [Sat, 26 Sep 2009 07:21:54 +0200] rev 731
Merge #298
Alpar Juttner <alpar@cs.elte.hu> [Sat, 26 Sep 2009 07:16:22 +0200] rev 730
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 25 Sep 2009 11:58:34 +0200] rev 729
Small improvements for NetworkSimplex (#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)
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 01 Jul 2009 16:34:01 +0200] rev 727
Small improvements in NS pivot rules (#298)
Alpar Juttner <alpar@cs.elte.hu> [Sat, 26 Sep 2009 07:08:10 +0200] rev 726
Merge #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)
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).
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 25 Sep 2009 12:12:37 +0200] rev 723
Extend maps_test.cc (#302)
Peter Kovacs <kpeter@inf.elte.hu> [Sun, 02 Aug 2009 17:22:43 +0200] rev 722
Doc improvements for several graph maps (#302)
Peter Kovacs <kpeter@inf.elte.hu> [Sun, 02 Aug 2009 13:44:45 +0200] rev 721
Merge
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.
Alpar Juttner <alpar@cs.elte.hu> [Fri, 25 Sep 2009 09:33:09 +0200] rev 719
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 20 Aug 2009 20:34:30 +0200] rev 718
Also check ReferenceMapTag in concept checks (#312)
Alpar Juttner <alpar@cs.elte.hu> [Fri, 25 Sep 2009 09:13:03 +0200] rev 717
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Sun, 02 Aug 2009 12:40:20 +0200] rev 716
Small doc improvements (#304)
Alpar Juttner <alpar@cs.elte.hu> [Fri, 25 Sep 2009 09:06:32 +0200] rev 715
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 24 Jul 2009 11:07:52 +0200] rev 714
Rearrange modules (#303)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 24 Jul 2009 10:27:40 +0200] rev 713
Small doc improvements
Alpar Juttner <alpar@cs.elte.hu> [Mon, 31 Aug 2009 20:27:38 +0200] rev 712
Merge
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
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 08 Jul 2009 17:22:36 +0200] rev 710
Move the heaps to a separate group (#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[].
Alpar Juttner <alpar@cs.elte.hu> [Mon, 31 Aug 2009 10:03:23 +0200] rev 708
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 24 Jul 2009 01:07:45 +0200] rev 707
Much faster implementation for BinomHeap (#301)
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 20 Jul 2009 19:06:39 +0200] rev 706
Smarter bubbleDown() in K-ary heaps (#301)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 10 Jul 2009 09:17:13 +0200] rev 705
Small improvements in heap implementations (#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)
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)
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 09 Jul 2009 02:39:47 +0200] rev 702
Bug fix in PairingHeap::pop() (#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.
Alpar Juttner <alpar@cs.elte.hu> [Mon, 31 Aug 2009 08:32:25 +0200] rev 700
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 03 Aug 2009 00:54:04 +0200] rev 699
Add negativeCycle() function to 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)
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.
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 24 Jul 2009 23:19:43 +0200] rev 696
Port Bellman-Ford algorithm from SVN -r3524 (#51)
Alpar Juttner <alpar@cs.elte.hu> [Mon, 31 Aug 2009 08:25:33 +0200] rev 695
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 21 Jul 2009 22:43:31 +0200] rev 694
Improvements for iterable maps (#73)
Balazs Dezso <deba@inf.elte.hu> [Sat, 27 Jun 2009 13:07:26 +0200] rev 693
Port iterable maps from SVN 3509 (#73)
Alpar Juttner <alpar@cs.elte.hu> [Mon, 31 Aug 2009 07:22:26 +0200] rev 692
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 03 Aug 2009 14:00:21 +0200] rev 691
Bug fix + extension in the rename script (#305)
Alpar Juttner <alpar@cs.elte.hu> [Mon, 31 Aug 2009 07:12:58 +0200] rev 690
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 18 Aug 2009 10:35:35 +0200] rev 689
Test file + doc improvements (#307)
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 18 Aug 2009 10:24:31 +0200] rev 688
Bug fix in Preflow and Circulation (#307)
Alpar Juttner <alpar@cs.elte.hu> [Thu, 20 Aug 2009 22:52:16 +0200] rev 687
Merge
Alpar Juttner <alpar@cs.elte.hu> [Thu, 20 Aug 2009 22:52:03 +0200] rev 686
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 20 Aug 2009 18:37:36 +0200] rev 685
Add missing 'explicit' keywords (#311)
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 23 Jul 2009 18:09:41 +0200] rev 684
Fix the implementation and doc of CrossRefMap (#302)
- Handle multiple values correctly with std::multimap.
- Clarify the problematic points in the doc.
- Add some basic tests for the class.
Balazs Dezso <deba@inf.elte.hu> [Thu, 11 Jun 2009 23:13:24 +0200] rev 683
Unification of names in heaps (#50)
Balazs Dezso <deba@inf.elte.hu> [Thu, 11 Jun 2009 22:16:11 +0200] rev 682
Simplified implementation of bucket heaps (#50)
Balazs Dezso <deba@inf.elte.hu> [Thu, 11 Jun 2009 22:11:29 +0200] rev 681
Port remaining heaps from SVN -r 3509 (#50)
- FibHeap
- RadixHeap
- BucketHeap
- SimpleBucketHeap
Akos Ladanyi <ladanyi@tmit.bme.hu> [Fri, 29 May 2009 17:46:48 +0100] rev 680
Set the version to 'hg-tip' if everything fails
Akos Ladanyi <ladanyi@tmit.bme.hu> [Fri, 29 May 2009 12:44:37 +0100] rev 679
Minor CMake improvements
* Use the empty ELSE(), ENDIF(), ENDMACRO(), etc. syntax since this improves
readability and requires less typing.
* Use FIND_PACKAGE() instead of INCLUDE().
* Use the value of CMAKE_COMMAND variable instead of cmake, since this works
even if cmake is not in the PATH.
Akos Ladanyi <ladanyi@tmit.bme.hu> [Fri, 29 May 2009 11:40:53 +0100] rev 678
Put the version string into config.h
Also make it possible to set the version using the LEMON_VERSION environment
variable, and use the hg revision as version string in case this variable is
unset.
Akos Ladanyi <ladanyi@tmit.bme.hu> [Fri, 29 May 2009 10:35:05 +0100] rev 677
Fix the check for the 'long long' type
Akos Ladanyi <ladanyi@tmit.bme.hu> [Thu, 28 May 2009 19:46:43 +0100] rev 676
Change the label of the html project in Visual Studio
Akos Ladanyi <ladanyi@tmit.bme.hu> [Wed, 27 May 2009 20:12:08 +0100] rev 675
Generate and install LEMONConfig.cmake
Akos Ladanyi <ladanyi@tmit.bme.hu> [Wed, 27 May 2009 13:08:47 +0100] rev 674
Add tools/CMakeLists.txt to the tarball
Akos Ladanyi <ladanyi@tmit.bme.hu> [Tue, 26 May 2009 17:49:10 +0100] rev 673
Rename documentation install folder from 'docs' to 'html'
Akos Ladanyi <ladanyi@tmit.bme.hu> [Tue, 26 May 2009 17:47:51 +0100] rev 672
Remove duplications from doc/CMakeLists.txt
Akos Ladanyi <ladanyi@tmit.bme.hu> [Thu, 28 May 2009 12:11:50 +0100] rev 671
Suppress MSVC warnings using pragmas (#295)
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 13 May 2009 10:42:26 +0200] rev 670
Add artificial addNode() function to the arc/edge set classes
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 12 May 2009 20:08:23 +0200] rev 669
Avoid Intel C++ Compiler warnings
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 12 May 2009 17:57:49 +0200] rev 668
Disable Visual Studio warning C4503
Alpar Juttner <alpar@cs.elte.hu> [Tue, 12 May 2009 15:55:00 +0100] rev 667
Add lemon/config.h.cmake to the tarball
Alpar Juttner <alpar@cs.elte.hu> [Tue, 12 May 2009 15:02:18 +0100] rev 666
Resolve GCC-4.4 warnings & fix ambiguous op=() in graph_components.h
Alpar Juttner <alpar@cs.elte.hu> [Tue, 12 May 2009 11:49:13 +0100] rev 665
Update NEWS file
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 12 May 2009 12:08:06 +0200] rev 664
Extend min cost flow test file + check dual costs (#291)
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 12 May 2009 12:06:40 +0200] rev 663
Fix the GEQ/LEQ handling in NetworkSimplex + improve doc (#291)
- Fix the optimality conditions for the GEQ/LEQ form.
- Fix the initialization of the algortihm. It ensures correct
solutions and it is much faster for the inequality forms.
- Fix the pivot rules to search all the arcs that have to be
allowed to get in the basis.
- Better block size for the Block Search pivot rule.
- Improve documentation of the problem and move it to a
separate page.
Alpar Juttner <alpar@cs.elte.hu> [Mon, 11 May 2009 16:38:21 +0100] rev 662
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Sat, 09 May 2009 16:47:26 +0200] rev 661
Remove bits/base_extender.h, which is not used at all (#288)
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 11 May 2009 17:04:40 +0200] rev 660
Move list and edge sets to the graph module (#290)
Alpar Juttner <alpar@cs.elte.hu> [Mon, 11 May 2009 15:48:37 +0100] rev 659
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 11 May 2009 16:42:42 +0200] rev 658
Change the explanation of the acronym LEMON (#289)
Peter Kovacs <kpeter@inf.elte.hu> [Sat, 09 May 2009 16:39:59 +0200] rev 657
Change Graph::Edge -> Graph::Arc inheritance to conversion (#283)
Balazs Dezso <deba@inf.elte.hu> [Thu, 07 May 2009 10:46:49 +0200] rev 656
Change Undirector::Edge -> Undirector::Arc inheritance to conversion (#283)
Alpar Juttner <alpar@cs.elte.hu> [Fri, 08 May 2009 16:21:06 +0100] rev 655
Fix the faulty merge of unify-sources.sh in [586b65073025]
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 08 May 2009 13:15:29 +0200] rev 654
Doc fixes for lgf-gen (#282)
Alpar Juttner <alpar@cs.elte.hu> [Thu, 07 May 2009 12:21:00 +0100] rev 653
Merge
Alpar Juttner <alpar@cs.elte.hu> [Thu, 07 May 2009 12:19:41 +0100] rev 652
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 07 May 2009 02:07:59 +0200] rev 651
Small doc improvements (#257)
Balazs Dezso <deba@inf.elte.hu> [Thu, 07 May 2009 11:53:49 +0200] rev 650
Fix glp_prob definition (#286)
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 06 May 2009 14:46:05 +0200] rev 649
Add a test file for the connectivity functions (#285)
The Euler tools have a separate test file.
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 06 May 2009 14:44:05 +0200] rev 648
Doc improvements and fixes for connectivity tools (#285)
And add loopFree(), parallelFree(), simpleGraph() to the module doc.
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 06 May 2009 14:37:44 +0200] rev 647
Bug fixes in connectivity.h (#285)
- Bug fix in tree().
- Rename simpleDigraph() to simpleGraph() (it works for both
directed and undirected graphs).
- Possibly faster implementation for parallelFree() and
simpleGraph().
Alpar Juttner <alpar@cs.elte.hu> [Wed, 29 Apr 2009 19:22:14 +0100] rev 646
Merge
Akos Ladanyi <ladanyi@tmit.bme.hu> [Wed, 29 Apr 2009 16:15:29 +0100] rev 645
Add the solver libraries to lemon.pc.in (#281)
Alpar Juttner <alpar@cs.elte.hu> [Wed, 29 Apr 2009 17:48:41 +0100] rev 644
Merge
Alpar Juttner <alpar@cs.elte.hu> [Wed, 29 Apr 2009 17:48:18 +0100] rev 643
Resolve gcc-4.3 warning in lemon/network_simplex.h
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 29 Apr 2009 16:54:27 +0200] rev 642
Less map copying in NetworkSimplex (#234)
- The graph is copied in the constructor instead of the init() function.
It must not be modified after the class is constructed.
- The maps are copied once (instead of twice).
- Remove FlowMap, PotentialMap typedefs and flowMap(), pontentialMap()
setter functions.
- flowMap() and potentialMap() query functions copy the values into the
given map (reference) instead of returning a const reference to a
previously constructed map.
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 29 Apr 2009 14:25:51 +0200] rev 641
Rename Flow to Value in the flow algorithms (#266)
We agreed that using Flow for the value type is misleading, since
a flow should be rather a function on the arcs, not a single value.
This patch reverts the changes of [dacc2cee2b4c] for Preflow and
Circulation.
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 29 Apr 2009 03:15:24 +0200] rev 640
Support negative costs and bounds in NetworkSimplex (#270)
* The interface is reworked to support negative costs and bounds.
- ProblemType and problemType() are renamed to
SupplyType and supplyType(), see also #234.
- ProblemType type is introduced similarly to the LP interface.
- 'bool run()' is replaced by 'ProblemType run()' to handle
unbounded problem instances, as well.
- Add INF public member constant similarly to the LP interface.
* Remove capacityMap() and boundMaps(), see also #266.
* Update the problem definition in the MCF module.
* Remove the usage of Circulation (and adaptors) for checking feasibility.
Check feasibility by examining the artifical arcs instead (after solving
the problem).
* Additional check for unbounded negative cycles found during the
algorithm (it is possible now, since negative costs are allowed).
* Fix in the constructor (the value types needn't be integer any more),
see also #254.
* Improve and extend the doc.
* Rework the test file and add test cases for negative costs and bounds.