4.4BSD/usr/share/man/cat1/tsort.0

TSORT(1)                     BSD Reference Manual                     TSORT(1)

NNAAMMEE
     ttssoorrtt - topological sort of a directed graph

SSYYNNOOPPSSIISS
     ttssoorrtt [_f_i_l_e]

DDEESSCCRRIIPPTTIIOONN
     TTssoorrtt takes a list of pairs of node names representing directed arcs in a
     graph and prints the nodes in topological order on standard output.  In-
     put is taken from the named _f_i_l_e, or from standard input if no file is
     given.

     Node names in the input are separated by white space and there must be an
     even number of nodes.

     Presence of a node in a graph can be represented by an arc from the node
     to itself.  This is useful when a node is not connected to any other
     nodes.

     If the graph contains a cycle (and therefore cannot be properly sorted),
     one of the arcs in the cycle is ignored and the sort continues.  Cycles
     are reported on standard error.

SSEEEE AALLSSOO
     ar(1)

HHIISSTTOORRYY
     A ttssoorrtt command appeared in Version 7 AT&T UNIX.  This ttssoorrtt command and
     manual page are derived from sources contributed to Berkeley by Michael
     Rendell of Memorial University of Newfoundland.

4.4BSD                           June 9, 1993                                1