1 .\" You may copy, distribute and modify under the terms of the LDP General
2 .\" Public License as specified in the LICENSE file that comes with the
3 .\" gnumaniak distribution
5 .\" The author kindly requests that no comments regarding the "better"
6 .\" suitability or up-to-date notices of any info documentation alternative
7 .\" is added without contacting him first.
9 .\" (C) 2002 Ragnar Hojland Espinosa <ragnar@ragnar-hojland.com>
11 .\" GNU tsort man page
12 .\" man pages are NOT obsolete!
13 .\" <ragnar@ragnar-hojland.com>
14 .TH TSORT 1 "7 October 2002" "GNU textutils 2.1"
16 \fBtsort\fR \- print byte, word, and line counts
21 .BR tsort " [" \-\-help "] [" \-\-version ]
23 \fBtsort\fR topologically sorts a given
25 is omitted or if it is a
27 standard input is used for reading.
29 String pairs, each element separated by blanks, are read from \fIFILE\fR.
30 The total order in relation with the partial order indicated by
31 the elements of the string pairs is then printed to standard output. If any
32 cycle is detected, it'll write the first one found to standard error.
36 Print a usage message on standard output and exit successfully.
39 Print version information on standard output then exit successfully.
41 We will give \fBtsort\fR a list of "X happened before Y" pairs,
42 and see if it can sort it. Note that for a given partial order there may be
43 no unique total order.
69 Report bugs to bug-textutils@gnu.org.
71 Man page by Ragnar Hojland Espinosa <ragnar@ragnar-hojland.com>