.\" Copyright (c) 1990 The Regents of the University of California.
.\" This manual is derived from one contributed to Berkeley by
.\" Michael Rendell of Memorial University of Newfoundland.
.\" %sccs.include.redist.roff%
.\" @(#)tsort.1 6.3 (Berkeley) %G%
.Nd topological sort of a directed graph
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
or from standard input if no file
Node names in the input are separated by white space and there must be an
Presence of a node in a graph can be represented by an arc from the node
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.
command and manual page are derived from sources contributed to Berkeley by
Michael Rendell of Memorial University of Newfoundland.