1 .\" Copyright (c) 1990, 1993, 1994
2 .\" The Regents of the University of California. All rights reserved.
4 .\" This manual is derived from one contributed to Berkeley by
5 .\" Michael Rendell of Memorial University of Newfoundland.
7 .\" Redistribution and use in source and binary forms, with or without
8 .\" modification, are permitted provided that the following conditions
10 .\" 1. Redistributions of source code must retain the above copyright
11 .\" notice, this list of conditions and the following disclaimer.
12 .\" 2. Redistributions in binary form must reproduce the above copyright
13 .\" notice, this list of conditions and the following disclaimer in the
14 .\" documentation and/or other materials provided with the distribution.
15 .\" 4. Neither the name of the University nor the names of its contributors
16 .\" may be used to endorse or promote products derived from this software
17 .\" without specific prior written permission.
19 .\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 .\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 .\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23 .\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 .\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 .\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 .\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 .\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 .\" @(#)tsort.1 8.3 (Berkeley) 4/1/94
39 .Nd topological sort of a directed graph
47 utility takes a list of pairs of node names representing directed arcs in
48 a graph and prints the nodes in topological order on standard output.
49 Input is taken from the named
51 or from standard input if no file
54 There must be an even number of nodes in the input.
55 Node names specified on the same line should be white space separated.
57 Presence of a node in a graph can be represented by an arc from the node
59 This is useful when a node is not connected to any other nodes.
61 If the graph contains a cycle (and therefore cannot be properly sorted),
62 one of the arcs in the cycle is ignored and the sort continues.
63 Cycles are reported on standard error.
65 The options are as follows:
66 .Bl -tag -width indent
70 Search for and display the longest cycle.
71 Can take a very long time.
73 Do not display informational messages about cycles.
75 intended for building libraries, where optimal ordering is not critical,
76 and cycles occur often.
87 command and manual page are derived from sources contributed to Berkeley by
89 of Memorial University of Newfoundland.
93 utility does not recognize multibyte characters.