summary |
shortlog | log |
commit |
commitdiff |
tree
first ⋅ prev ⋅ next
Florian Forster [Mon, 11 Feb 2008 13:56:45 +0000 (14:56 +0100)]
sn-evolution: Implemented the use of `getopt'.
Florian Forster [Sat, 2 Feb 2008 00:01:56 +0000 (01:01 +0100)]
src/sn-evolution.c: Free the population before exiting.
Florian Forster [Sat, 2 Feb 2008 00:01:19 +0000 (01:01 +0100)]
Added a `clean' target.
Florian Forster [Sat, 2 Feb 2008 00:01:04 +0000 (01:01 +0100)]
src/sn_network.c: Fixed two memory leaks.
Florian Forster [Fri, 1 Feb 2008 19:24:55 +0000 (20:24 +0100)]
src/sn-evolution.c: Change the default number of iterations to INT_MAX.
Florian Forster [Fri, 1 Feb 2008 19:19:43 +0000 (20:19 +0100)]
src/sn-evolution.c: Added an `olymp'.
This means that every solution is in the population for a garuanteed number of
iterations.
Florian Forster [Fri, 1 Feb 2008 19:05:09 +0000 (20:05 +0100)]
src/sn-evolution.c: Installed a SIGINT handler to shutdown cleanly upon sigint.
The best solution is then written to STDOUT before exiting.
Florian Forster [Fri, 1 Feb 2008 18:30:56 +0000 (19:30 +0100)]
src/sn-evolution.c: Added a first version of evolutionary optimization.
Florian Forster [Fri, 1 Feb 2008 15:52:55 +0000 (16:52 +0100)]
Imported the initial C files that make up a decent sorting network toolkit already.
The files built up to know are:
- sn-cut: Does a min/max cut on a given input.
- sn-merge: Merges two networks (files) by appending a bitonic merge.
- sn-show: Pretty-prints a network to stdout.