Antal Nemes <thoneyvazul@gmail.com> [Tue, 30 Nov 2010 20:21:52 +0100] rev 1224
Port Edmonds-Karp algorithm from svn -r3524 (#177)
Alpar Juttner <alpar@cs.elte.hu> [Mon, 18 Mar 2013 18:48:58 +0100] rev 1223
Merge #442
Alpar Juttner <alpar@cs.elte.hu> [Tue, 05 Jun 2012 12:06:28 +0200] rev 1222
New features in time_measure.h (#442)
Alpar Juttner <alpar@cs.elte.hu> [Mon, 18 Mar 2013 17:41:19 +0100] rev 1221
Use doxygen's own bibtex support (#456)
Peter Kovacs <kpeter@inf.elte.hu> [Sat, 16 Mar 2013 14:11:32 +0100] rev 1220
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 1219
Add references to papers related to LEMON (#459)
Peter Kovacs <kpeter@inf.elte.hu> [Sat, 16 Mar 2013 13:16:27 +0100] rev 1218
Add images to the doc of two groups (#459)
Peter Kovacs <kpeter@inf.elte.hu> [Sat, 16 Mar 2013 13:14:35 +0100] rev 1217
Minor fixes and improvements in the doc (#459)
Alpar Juttner <alpar@cs.elte.hu> [Fri, 15 Mar 2013 17:19:17 +0100] rev 1216
Merge #411
Alpar Juttner <alpar@cs.elte.hu> [Fri, 15 Mar 2013 17:15:46 +0100] rev 1215
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 08 Mar 2013 01:13:54 +0100] rev 1214
Adjust image sizes in the documentation (#411)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 08 Mar 2013 01:12:05 +0100] rev 1213
Improve images of the Connectivity section (#411)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 08 Mar 2013 10:47:38 +0100] rev 1212
Greatly extend path_test.cc + fix compiler warning (#408)
Alpar Juttner <alpar@cs.elte.hu> [Sat, 20 Mar 2010 11:03:12 +0100] rev 1211
More tests for radixSort() (#362)
Balazs Dezso <deba@inf.elte.hu> [Fri, 19 Mar 2010 18:23:47 +0100] rev 1210
Bidirectional iterator support for radixSort() (#362)
Alpar Juttner <alpar@cs.elte.hu> [Fri, 01 Mar 2013 18:20:07 +0100] rev 1209
Merge #455
Alpar Juttner <alpar@cs.elte.hu> [Wed, 19 Dec 2012 15:37:12 +0100] rev 1208
Use MathJax for rendering the math formulae (#455)
Alpar Juttner <alpar@cs.elte.hu> [Wed, 19 Dec 2012 15:37:12 +0100] rev 1207
Fix 'make update-external-tags' behavior (#455)
Alpar Juttner <alpar@cs.elte.hu> [Fri, 01 Mar 2013 17:59:08 +0100] rev 1206
Merge #386
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 28 Feb 2013 17:13:14 +0100] rev 1205
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 1204
Make InsertionTsp much faster and improve docs (#386)
Peter Kovacs <kpeter@inf.elte.hu> [Sun, 09 Jan 2011 00:57:12 +0100] rev 1203
A detailed test file for TSP algorithms (#386)
Peter Kovacs <kpeter@inf.elte.hu> [Sun, 09 Jan 2011 00:56:52 +0100] rev 1202
Unifications and improvements in TSP algorithms (#386)
Peter Kovacs <kpeter@inf.elte.hu> [Sat, 08 Jan 2011 22:51:16 +0100] rev 1201
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 1200
Doc group for TSP algorithms (#386)
Gabor Varga <f4c3@inf.elte.hu> [Sat, 08 Jan 2011 21:59:56 +0100] rev 1199
Heuristic algorithms for symmetric TSP (#386)
Balazs Dezso <deba@google.com> [Tue, 12 Feb 2013 07:15:52 +0100] rev 1198
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 1197
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 1196
Doc fix in BpGraphs (#69)
Balazs Dezso <deba@inf.elte.hu> [Wed, 11 Jan 2012 22:43:50 +0100] rev 1195
Remove asRedBludeNode() function (#69)
Balazs Dezso <deba@inf.elte.hu> [Wed, 11 Jan 2012 22:21:07 +0100] rev 1194
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 1193
Type safe red and blue node set (#69)
Balazs Dezso <deba@inf.elte.hu> [Thu, 25 Nov 2010 22:45:29 +0100] rev 1192
LGF reader and writer for bipartite graphs (#69)
Balazs Dezso <deba@inf.elte.hu> [Tue, 16 Nov 2010 08:19:11 +0100] rev 1191
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 1190
Implementation of BpGraphCopy (#69)
Balazs Dezso <deba@inf.elte.hu> [Mon, 15 Nov 2010 09:46:08 +0100] rev 1189
ListBpGraph implementation (#69)
Balazs Dezso <deba@inf.elte.hu> [Sun, 14 Nov 2010 22:48:32 +0100] rev 1188
FullBpGraph implementation (#69)
Balazs Dezso <deba@inf.elte.hu> [Sun, 14 Nov 2010 20:06:23 +0100] rev 1187
SmartBpGraph implementation (#69)
Balazs Dezso <deba@inf.elte.hu> [Sun, 14 Nov 2010 16:35:31 +0100] rev 1186
Add bipartite graph concepts (#69)
Alpar Juttner <alpar@cs.elte.hu> [Sun, 24 Feb 2013 19:44:14 +0100] rev 1185
Better Maintainer build type settings (for MSVC)
Alpar Juttner <alpar@cs.elte.hu> [Fri, 22 Feb 2013 16:49:41 +0100] rev 1184
Merge bugfix #445
Alpar Juttner <alpar@cs.elte.hu> [Fri, 22 Feb 2013 16:44:26 +0100] rev 1183
Merge bugfix #445 to branch 1.2
Alpar Juttner <alpar@cs.elte.hu> [Fri, 22 Feb 2013 16:42:56 +0100] rev 1182
Merge bugfix #445 to branch 1.1
Alpar Juttner <alpar@cs.elte.hu> [Fri, 20 Jul 2012 21:23:17 +0200] rev 1181
Fix missing initialization in CplexEnv::CplexEnv() (#445)
Alpar Juttner <alpar@cs.elte.hu> [Fri, 22 Feb 2013 14:12:48 +0100] rev 1180
Merge #438 and #436
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 15 Nov 2012 07:17:48 +0100] rev 1179
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 1178
Optional iteration limit in HowardMmc (#438)
Alpar Juttner <alpar@cs.elte.hu> [Wed, 28 Nov 2012 12:08:47 +0100] rev 1177
Further GCC 4.7 compiler warning fix (#453)
Alpar Juttner <alpar@cs.elte.hu> [Wed, 28 Nov 2012 12:05:27 +0100] rev 1176
Merge bugfix #453
Alpar Juttner <alpar@cs.elte.hu> [Wed, 28 Nov 2012 12:02:36 +0100] rev 1175
Merge bugfix #453 to branch 1.2
Alpar Juttner <alpar@cs.elte.hu> [Wed, 28 Nov 2012 11:58:00 +0100] rev 1174
Further GCC 4.7 compiler warning fixes (#453)
Alpar Juttner <alpar@cs.elte.hu> [Wed, 28 Nov 2012 11:54:43 +0100] rev 1173
Merge #453 to branches >=1.2
Alpar Juttner <alpar@cs.elte.hu> [Wed, 28 Nov 2012 11:42:38 +0100] rev 1172
Merge bugfix #453 to branch 1.1
Alpar Juttner <alpar@cs.elte.hu> [Wed, 28 Nov 2012 11:41:40 +0100] rev 1171
Avoid GCC 4.7 compiler warnings (#453)
Alpar Juttner <alpar@cs.elte.hu> [Thu, 08 Nov 2012 09:07:41 +0100] rev 1170
Merge bugfix #440
Alpar Juttner <alpar@cs.elte.hu> [Wed, 07 Nov 2012 18:13:26 +0100] rev 1169
Merge bugfix #440 to branch 1.2
Alpar Juttner <alpar@cs.elte.hu> [Wed, 07 Nov 2012 18:10:07 +0100] rev 1168
Merge bugfix #440 to branch 1.1
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 28 Mar 2012 19:39:56 +0200] rev 1167
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 1166
Merge docfix #437
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 30 Jan 2012 23:24:40 +0100] rev 1165
Doc improvements for min cost flow algorithms (#437)