2005-05-02 15:01:42 +02:00
|
|
|
.TH TSORT 1
|
|
|
|
|
.SH NAME
|
|
|
|
|
tsort \- topological sort [IBM]
|
|
|
|
|
.SH SYNOPSIS
|
|
|
|
|
\fBtsort \fIfile\fR
|
|
|
|
|
.br
|
|
|
|
|
.de FL
|
|
|
|
|
.TP
|
|
|
|
|
\\fB\\$1\\fR
|
|
|
|
|
\\$2
|
|
|
|
|
..
|
|
|
|
|
.de EX
|
|
|
|
|
.TP 20
|
|
|
|
|
\\fB\\$1\\fR
|
|
|
|
|
# \\$2
|
|
|
|
|
..
|
|
|
|
|
.SH EXAMPLES
|
2012-03-31 23:44:29 +02:00
|
|
|
.TP 20
|
|
|
|
|
.B lorder *.s | tsort
|
|
|
|
|
# Give library ordering
|
|
|
|
|
.TP 20
|
|
|
|
|
.B ar cr libc.a \`lorder *.s | tsort\`
|
|
|
|
|
# Build library
|
2005-05-02 15:01:42 +02:00
|
|
|
.SH DESCRIPTION
|
|
|
|
|
.PP
|
|
|
|
|
\fITsort\fR accepts a file of lines containing ordered pairs and builds a
|
|
|
|
|
total ordering from the partial orderings.
|
