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