Return to tsort.1 CVS log

Up to [CSRG BSD Unix] / 43BSDReno / pgrm / tsort

Annotation of 43BSDReno/pgrm/tsort/tsort.1, revision 1.1

1.1     ! root        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: .\"
        !             7: .\" Redistribution and use in source and binary forms are permitted provided
        !             8: .\" that: (1) source distributions retain this entire copyright notice and
        !             9: .\" comment, and (2) distributions including binaries display the following
        !            10: .\" acknowledgement:  ``This product includes software developed by the
        !            11: .\" University of California, Berkeley and its contributors'' in the
        !            12: .\" documentation or other materials provided with the distribution and in
        !            13: .\" all advertising materials mentioning features or use of this software.
        !            14: .\" Neither the name of the University nor the names of its contributors may
        !            15: .\" be used to endorse or promote products derived from this software without
        !            16: .\" specific prior written permission.
        !            17: .\" THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED
        !            18: .\" WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF
        !            19: .\" MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
        !            20: .\"
        !            21: .\"     @(#)tsort.1    6.4 (Berkeley) 6/24/90
        !            22: .\"
        !            23: .TH tsort 1 "%Q"
        !            24: .AT 3
        !            25: .SH NAME
        !            26: tsort \- topological sort of a directed graph
        !            27: .SH SYNOPSIS
        !            28: .nf
        !            29: .ft B
        !            30: tsort [ file ]
        !            31: .ft R
        !            32: .fi
        !            33: .SH DESCRIPTION
        !            34: .I Tsort
        !            35: takes a list of pairs of node names representing directed arcs in
        !            36: a graph and prints the nodes in topological order on standard output.
        !            37: Input is taken from the named file, or from standard input if no file
        !            38: is given.
        !            39: .PP
        !            40: Node names in the input are separated by white space and there must be an
        !            41: even number of nodes.
        !            42: .PP
        !            43: Presence of a node in a graph can be represented by an arc from the node
        !            44: to itself.
        !            45: This is useful when a node is not connected to any other nodes.
        !            46: .PP
        !            47: If the graph contains a cycle (and therefore cannot be properly sorted),
        !            48: one of the arcs in the cycle is ignored and the sort continues.
        !            49: Cycles are reported on standard error.

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