tsort(1)	    UNIX Programmer's Manual		 tsort(1)



NNAAMMEE
     tsort - topological sort of a directed graph

SSYYNNOOPPSSIISS
     ttssoorrtt [[ ffiillee ]]

DDEESSCCRRIIPPTTIIOONN
     _T_s_o_r_t takes a list of pairs of node names representing
     directed arcs in a graph and prints the nodes in topological
     order on standard output.	Input is taken from the named
     file, 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 prop-
     erly sorted), one of the arcs in the cycle is ignored and
     the sort continues.  Cycles are reported on standard error.

































Printed 7/27/90                1Q				1