Return to tsort.1 CVS log

Up to [CSRG BSD Unix] / 43BSDTahoe / man / man1

BSD 4.3tahoe

.\"	@(#)tsort.1	6.1 (Berkeley) 4/29/85
.\"
.TH TSORT 1 "April 29, 1985"
.AT 3
.SH NAME
tsort \- topological sort
.SH SYNOPSIS
.B tsort
[ file ]
.SH DESCRIPTION
.I Tsort
produces on the standard output a totally ordered list of items
consistent with a partial ordering of items
mentioned in the input
.IR file .
If no
.I file
is specified, the standard input is understood.
.PP
The input consists of pairs of items (nonempty strings)
separated by blanks.
Pairs of different items indicate ordering.
Pairs of identical items indicate presence, but not ordering.
.SH "SEE ALSO"
lorder(1)
.SH DIAGNOSTICS
Odd data: there is an odd number of fields in the input file.
.SH BUGS
Uses a quadratic algorithm;
not worth fixing for the typical use of ordering
a library archive file.

This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.