.\" @(#)tsort.1 6.1 (Berkeley) %G%
tsort \- topological sort
produces on the standard output a totally ordered list of items
consistent with a partial ordering of items
is specified, the standard input is understood.
The input consists of pairs of items (nonempty strings)
Pairs of different items indicate ordering.
Pairs of identical items indicate presence, but not ordering.
Odd data: there is an odd number of fields in the input file.
Uses a quadratic algorithm;
not worth fixing for the typical use of ordering