projects / unix-history / blame
| Commit | Line | Data |
|---|---|---|
| 53cba2ac WJ |
1 | .\" Copyright (c) 1990 The Regents of the University of California. |
| 2 | .\" All rights reserved. | |
| 3 | .\" | |
| 4 | .\" This manual is derived from one contributed to Berkeley by | |
| 5 | .\" Michael Rendell of Memorial University of Newfoundland. | |
| 6 | .\" Redistribution and use in source and binary forms, with or without | |
| 7 | .\" modification, are permitted provided that the following conditions | |
| 8 | .\" are met: | |
| 9 | .\" 1. Redistributions of source code must retain the above copyright | |
| 10 | .\" notice, this list of conditions and the following disclaimer. | |
| 11 | .\" 2. Redistributions in binary form must reproduce the above copyright | |
| 12 | .\" notice, this list of conditions and the following disclaimer in the | |
| 13 | .\" documentation and/or other materials provided with the distribution. | |
| 14 | .\" 3. All advertising materials mentioning features or use of this software | |
| 15 | .\" must display the following acknowledgement: | |
| 16 | .\" This product includes software developed by the University of | |
| 17 | .\" California, Berkeley and its contributors. | |
| 18 | .\" 4. Neither the name of the University nor the names of its contributors | |
| 19 | .\" may be used to endorse or promote products derived from this software | |
| 20 | .\" without specific prior written permission. | |
| 21 | .\" | |
| 22 | .\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND | |
| 23 | .\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
| 24 | .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | |
| 25 | .\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE | |
| 26 | .\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | |
| 27 | .\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS | |
| 28 | .\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | |
| 29 | .\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | |
| 30 | .\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY | |
| 31 | .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | |
| 32 | .\" SUCH DAMAGE. | |
| 33 | .\" | |
| 34 | .\" @(#)tsort.1 6.3 (Berkeley) 4/23/91 | |
| 35 | .\" | |
| 36 | .Dd April 23, 1991 | |
| 37 | .Dt TSORT 1 | |
| 38 | .Os | |
| 39 | .Sh NAME | |
| 40 | .Nm tsort | |
| 41 | .Nd topological sort of a directed graph | |
| 42 | .Sh SYNOPSIS | |
| 43 | .Nm tsort | |
| 44 | .Op Ar file | |
| 45 | .Sh DESCRIPTION | |
| 46 | .Nm Tsort | |
| 47 | 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 | |
| 50 | .Ar file , | |
| 51 | or from standard input if no file | |
| 52 | is given. | |
| 53 | .Pp | |
| 54 | Node names in the input are separated by white space and there must be an | |
| 55 | even number of nodes. | |
| 56 | .Pp | |
| 57 | Presence of a node in a graph can be represented by an arc from the node | |
| 58 | to itself. | |
| 59 | This is useful when a node is not connected to any other nodes. | |
| 60 | .Pp | |
| 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. | |
| 64 | .Sh SEE ALSO | |
| 65 | .Xr ar 1 | |
| 66 | .Sh HISTORY | |
| 67 | A | |
| 68 | .Nm | |
| 69 | command appeared in | |
| 70 | .At v7 . | |
| 71 | This | |
| 72 | .Nm tsort | |
| 73 | command and manual page are derived from sources contributed to Berkeley by | |
| 74 | Michael Rendell of Memorial University of Newfoundland. |