projects
/
sort-networks.git
/ commitdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
| commitdiff |
tree
raw
|
patch
|
inline
| side by side (parent:
01403e3
)
README: Updated.
author
Florian Forster
<octo@leeloo.octo.it>
Tue, 21 Dec 2010 10:53:11 +0000
(11:53 +0100)
committer
Florian Forster
<octo@leeloo.octo.it>
Tue, 21 Dec 2010 10:53:11 +0000
(11:53 +0100)
README
patch
|
blob
|
history
diff --git
a/README
b/README
index
3278196
..
552d6b9
100644
(file)
--- a/
README
+++ b/
README
@@
-20,12
+20,12
@@
The distribution includes the following utility programs:
the list. The resulting list of printed to STDOUT.
* sn-bitonicmerge
the list. The resulting list of printed to STDOUT.
* sn-bitonicmerge
- Create a bitonic merge network with a given number of left and right
+ Create
s
a bitonic merge network with a given number of left and right
inputs. The resulting network is printed to STDOUT.
* sn-bitonicsort
Creates a bitonic mergesort network with a given number of inputs and
inputs. The resulting network is printed to STDOUT.
* sn-bitonicsort
Creates a bitonic mergesort network with a given number of inputs and
- prints the network to STDOUT.
The number of inputs must be a power of two.
+ prints the network to STDOUT.
* sn-check-bf
Does a brute-force check whether a given comparator network is a sort
* sn-check-bf
Does a brute-force check whether a given comparator network is a sort
@@
-33,14
+33,14
@@
The distribution includes the following utility programs:
time, so only small networks can be tested within a reasonable time.
* sn-cut
time, so only small networks can be tested within a reasonable time.
* sn-cut
- Remove
an input by assuming positive or negative infinity to be applied to
-
one input and "winning" or "losing" all comparisons
.
+ Remove
s one or more inputs by assuming positive or negative infinity to be
+
applied to the inputs to remove
.
* sn-info
* sn-info
- Display information about a comparator network in human readable form.
+ Display
s
information about a comparator network in human readable form.
* sn-merge
* sn-merge
- Combine
two sort networks using the odd-even-
merge network.
+ Combine
s two sort networks using the odd-even or bitonic
merge network.
* sn-normalize
Reads a sort network and prints a normalized version to STDOUT. A
* sn-normalize
Reads a sort network and prints a normalized version to STDOUT. A
@@
-48,7
+48,7
@@
The distribution includes the following utility programs:
way.
* sn-oddevenmerge
way.
* sn-oddevenmerge
- Create an odd-even merge network with a given number of left and right
+ Create
s
an odd-even merge network with a given number of left and right
inputs. The resulting network is printed to STDOUT.
* sn-oddevensort
inputs. The resulting network is printed to STDOUT.
* sn-oddevensort
@@
-56,7
+56,8
@@
The distribution includes the following utility programs:
prints the network to STDOUT.
* sn-pairwisesort
prints the network to STDOUT.
* sn-pairwisesort
- Create a pairwise sorting network based on the paper by Ian Parberry.
+ Creates a pairwise sorting network based on the paper by Ian Parberry.
+ The number of inputs must be a power of two.
* sn-shmoo
Prints a so-called "shmoo chart" of a comparator network to STDOUT. The
* sn-shmoo
Prints a so-called "shmoo chart" of a comparator network to STDOUT. The
@@
-66,6
+67,10
@@
The distribution includes the following utility programs:
* sn-show
Prints an ASCII version of a sort network to STDOUT.
* sn-show
Prints an ASCII version of a sort network to STDOUT.
+ * sn-svg
+ Prints the Scalable Vector Graphics (SVG) sources of a graphic
+ representation of a comparator network to STDOUT.
+
* sn-tex
Prints the TikZ / TeX sources of a graphic representation of a comparator
network to STDOUT.
* sn-tex
Prints the TikZ / TeX sources of a graphic representation of a comparator
network to STDOUT.