test/min_cost_flow_test.cc
Sat, 06 Mar 2010 14:35:12 +0000 Unify the sources (#339)
Wed, 10 Feb 2010 19:05:20 +0100 Handle graph changes in the MCF algorithms (#327)
Fri, 13 Nov 2009 00:24:39 +0100 Adds tests for the new MCF algorithms (#180)
Fri, 13 Nov 2009 00:23:07 +0100 Rework the MCF test file to help extending it (#180)
Tue, 12 May 2009 20:08:23 +0200 Avoid Intel C++ Compiler warnings
Tue, 12 May 2009 12:08:06 +0200 Extend min cost flow test file + check dual costs (#291)
Wed, 29 Apr 2009 16:54:27 +0200 Less map copying in NetworkSimplex (#234)
Wed, 29 Apr 2009 03:15:24 +0200 Support negative costs and bounds in NetworkSimplex (#270)
Fri, 24 Apr 2009 12:23:53 +0200 Exploit the changes of #190 in MCF test file (#234, #190)
Fri, 17 Apr 2009 18:04:36 +0200 Support >= and <= constraints in NetworkSimplex (#219, #234)
Fri, 03 Apr 2009 13:46:16 +0200 Separate types for flow and cost values in NetworkSimplex (#234)
Wed, 25 Mar 2009 21:37:50 +0100 Support multiple run() calls in NetworkSimplex (#234)
Wed, 25 Mar 2009 15:58:44 +0100 Rework the interface of NetworkSimplex (#234)
Tue, 24 Feb 2009 09:46:02 +0100 Port NetworkSimplex from SVN -r3520 (#234)