Wed, 22 Sep 2010 08:53:09 +0200Bug fix in Dfs::start(s,t) (#392)
Alpar Juttner <alpar@cs.elte.hu> [Wed, 22 Sep 2010 08:53:09 +0200] rev 737
Bug fix in Dfs::start(s,t) (#392)

Tue, 21 Sep 2010 06:28:35 +0200LEMON 1.1.3 released (dfdb58f52f02 tagged as r1.1.3) 1.1
Alpar Juttner <alpar@cs.elte.hu> [Tue, 21 Sep 2010 06:28:35 +0200] rev 736
LEMON 1.1.3 released (dfdb58f52f02 tagged as r1.1.3)

Tue, 21 Sep 2010 06:01:30 +0200Update NEWS file 1.1 r1.1.3
Alpar Juttner <alpar@cs.elte.hu> [Tue, 21 Sep 2010 06:01:30 +0200] rev 735
Update NEWS file

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 734
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 733
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 732
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.

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 731
Bug fix in (di)graphCopy() (#371)

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

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 730
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 729
Fix the usage of min() (#368)

Mon, 12 Apr 2010 16:52:48 +0200Merge bugfix #366 to branch 1.1 1.1
Alpar Juttner <alpar@cs.elte.hu> [Mon, 12 Apr 2010 16:52:48 +0200] rev 728
Merge bugfix #366 to branch 1.1