Sun, 22 Aug 2010 23:54:10 +0200Improve the tree update process and a pivot rule (#391)
Peter Kovacs <kpeter@inf.elte.hu> [Sun, 22 Aug 2010 23:54:10 +0200] rev 895
Improve the tree update process and a pivot rule (#391)
and make some parts of the code clearer using better names

Tue, 22 Jun 2010 16:13:00 +0200Improve graph_copy_test.cc
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 22 Jun 2010 16:13:00 +0200] rev 894
Improve graph_copy_test.cc

Fri, 25 Jun 2010 06:41:55 +0200Merge bugfix #371
Alpar Juttner <alpar@cs.elte.hu> [Fri, 25 Jun 2010 06:41:55 +0200] rev 893
Merge bugfix #371

Fri, 25 Jun 2010 06:00:56 +0200Merge bugfix #372
Alpar Juttner <alpar@cs.elte.hu> [Fri, 25 Jun 2010 06:00:56 +0200] rev 892
Merge bugfix #372

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 891
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 890
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 889
Merge bugfix #368