| 1 | .\" @(#)tsort.1 6.1 (Berkeley) %G% |
| 2 | .\" |
| 3 | .TH TSORT 1 "" |
| 4 | .AT 3 |
| 5 | .SH NAME |
| 6 | tsort \- topological sort |
| 7 | .SH SYNOPSIS |
| 8 | .B tsort |
| 9 | [ file ] |
| 10 | .SH DESCRIPTION |
| 11 | .I Tsort |
| 12 | produces on the standard output a totally ordered list of items |
| 13 | consistent with a partial ordering of items |
| 14 | mentioned in the input |
| 15 | .IR file . |
| 16 | If no |
| 17 | .I file |
| 18 | is specified, the standard input is understood. |
| 19 | .PP |
| 20 | The input consists of pairs of items (nonempty strings) |
| 21 | separated by blanks. |
| 22 | Pairs of different items indicate ordering. |
| 23 | Pairs of identical items indicate presence, but not ordering. |
| 24 | .SH "SEE ALSO" |
| 25 | lorder(1) |
| 26 | .SH DIAGNOSTICS |
| 27 | Odd data: there is an odd number of fields in the input file. |
| 28 | .SH BUGS |
| 29 | Uses a quadratic algorithm; |
| 30 | not worth fixing for the typical use of ordering |
| 31 | a library archive file. |