Fri, 25 Jun 2010 06:15:43 +0200Merge bugfix #371 to branch 1.1 1.1
Alpar Juttner <alpar@cs.elte.hu> [Fri, 25 Jun 2010 06:15:43 +0200] rev 984
Merge bugfix #371 to branch 1.1

Fri, 25 Jun 2010 05:48:27 +0200Merge bugfix #372 to branch 1.1 1.1
Alpar Juttner <alpar@cs.elte.hu> [Fri, 25 Jun 2010 05:48:27 +0200] rev 983
Merge bugfix #372 to branch 1.1

Thu, 24 Jun 2010 09:27:53 +0200Fix critical bug in preflow (#372)
Balazs Dezso <deba@inf.elte.hu> [Thu, 24 Jun 2010 09:27:53 +0200] rev 982
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.

Fri, 25 Jun 2010 06:03:25 +0200Merge bugfix #371 to branch 1.0 1.0
Alpar Juttner <alpar@cs.elte.hu> [Fri, 25 Jun 2010 06:03:25 +0200] rev 981
Merge bugfix #371 to branch 1.0

Tue, 22 Jun 2010 15:39:26 +0200Bug fix in (di)graphCopy() (#371)
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 22 Jun 2010 15:39:26 +0200] rev 980
Bug fix in (di)graphCopy() (#371)

The target graph is cleared before adding nodes and arcs/edges.

Mon, 03 May 2010 10:56:24 +0200Merge bugfix #368
Alpar Juttner <alpar@cs.elte.hu> [Mon, 03 May 2010 10:56:24 +0200] rev 979
Merge bugfix #368

Mon, 03 May 2010 10:24:52 +0200Merge bugfix #368 to branch 1.2 1.2
Alpar Juttner <alpar@cs.elte.hu> [Mon, 03 May 2010 10:24:52 +0200] rev 978
Merge bugfix #368 to branch 1.2

Mon, 03 May 2010 10:16:01 +0200Merge bugfix #368 to branch 1.1 1.1
Alpar Juttner <alpar@cs.elte.hu> [Mon, 03 May 2010 10:16:01 +0200] rev 977
Merge bugfix #368 to branch 1.1

Sun, 02 May 2010 18:53:56 +0200Fix the usage of min() (#368)
Peter Kovacs <kpeter@inf.elte.hu> [Sun, 02 May 2010 18:53:56 +0200] rev 976
Fix the usage of min() (#368)

Mon, 12 Apr 2010 17:05:49 +0200Merge bugfix #366
Alpar Juttner <alpar@cs.elte.hu> [Mon, 12 Apr 2010 17:05:49 +0200] rev 975
Merge bugfix #366