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