2010-09-21Update NEWS file 1.2 r1.2.1
Alpar Juttner <alpar@cs.elte.hu> [Tue, 21 Sep 2010 06:02:23 +0200] rev 897
Update NEWS file

2010-06-25Merge bugfix #371 to branch 1.2 1.2
Alpar Juttner <alpar@cs.elte.hu> [Fri, 25 Jun 2010 06:20:28 +0200] rev 896
Merge bugfix #371 to branch 1.2

2010-06-25Merge bugfix #372 to branch 1.2 1.2
Alpar Juttner <alpar@cs.elte.hu> [Fri, 25 Jun 2010 05:54:56 +0200] rev 895
Merge bugfix #372 to branch 1.2

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

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

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

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

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