Return to tsort.1 CVS log

Up to [local] / src / usr.bin / tsort

Annotation of src/usr.bin/tsort/tsort.1, Revision 1.1

1.1     ! deraadt     1: .\"    $NetBSD: tsort.1,v 1.5 1994/12/07 01:06:24 jtc Exp $
        !             2: .\"
        !             3: .\" Copyright (c) 1990, 1993, 1994
        !             4: .\"    The Regents of the University of California.  All rights reserved.
        !             5: .\"
        !             6: .\" This manual is derived from one contributed to Berkeley by
        !             7: .\" Michael Rendell of Memorial University of Newfoundland.
        !             8: .\"
        !             9: .\" Redistribution and use in source and binary forms, with or without
        !            10: .\" modification, are permitted provided that the following conditions
        !            11: .\" are met:
        !            12: .\" 1. Redistributions of source code must retain the above copyright
        !            13: .\"    notice, this list of conditions and the following disclaimer.
        !            14: .\" 2. Redistributions in binary form must reproduce the above copyright
        !            15: .\"    notice, this list of conditions and the following disclaimer in the
        !            16: .\"    documentation and/or other materials provided with the distribution.
        !            17: .\" 3. All advertising materials mentioning features or use of this software
        !            18: .\"    must display the following acknowledgement:
        !            19: .\"    This product includes software developed by the University of
        !            20: .\"    California, Berkeley and its contributors.
        !            21: .\" 4. Neither the name of the University nor the names of its contributors
        !            22: .\"    may be used to endorse or promote products derived from this software
        !            23: .\"    without specific prior written permission.
        !            24: .\"
        !            25: .\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
        !            26: .\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
        !            27: .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
        !            28: .\" ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
        !            29: .\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
        !            30: .\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
        !            31: .\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
        !            32: .\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
        !            33: .\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
        !            34: .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
        !            35: .\" SUCH DAMAGE.
        !            36: .\"
        !            37: .\"     @(#)tsort.1    8.3 (Berkeley) 4/1/94
        !            38: .\"
        !            39: .Dd April 1, 1994
        !            40: .Dt TSORT 1
        !            41: .Os
        !            42: .Sh NAME
        !            43: .Nm tsort
        !            44: .Nd topological sort of a directed graph
        !            45: .Sh SYNOPSIS
        !            46: .Nm tsort
        !            47: .Op Fl l
        !            48: .Op Ar file
        !            49: .Sh DESCRIPTION
        !            50: .Nm Tsort
        !            51: takes a list of pairs of node names representing directed arcs in
        !            52: a graph and prints the nodes in topological order on standard output.
        !            53: Input is taken from the named
        !            54: .Ar file ,
        !            55: or from standard input if no file
        !            56: is given.
        !            57: .Pp
        !            58: Node names in the input are separated by white space and there must
        !            59: be an even number of node pairs.
        !            60: .Pp
        !            61: Presence of a node in a graph can be represented by an arc from the node
        !            62: to itself.
        !            63: This is useful when a node is not connected to any other nodes.
        !            64: .Pp
        !            65: If the graph contains a cycle (and therefore cannot be properly sorted),
        !            66: one of the arcs in the cycle is ignored and the sort continues.
        !            67: Cycles are reported on standard error.
        !            68: .Pp
        !            69: The options are as follows:
        !            70: .Bl -tag -width Ds
        !            71: .It Fl l
        !            72: Search for and display the longest cycle.
        !            73: Can take a very long time.
        !            74: .El
        !            75: .Sh SEE ALSO
        !            76: .Xr ar 1
        !            77: .Sh HISTORY
        !            78: A
        !            79: .Nm
        !            80: command appeared in
        !            81: .At v7 .
        !            82: This
        !            83: .Nm tsort
        !            84: command and manual page are derived from sources contributed to Berkeley by
        !            85: Michael Rendell of Memorial University of Newfoundland.