The Perl Toolchain Summit needs more sponsors. If your company depends on Perl, please support this very important event.
CWEST / ppt-0.14 / html / commands / tsort / tcsort.html 
<html><head><title>tcsort</title>
<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1" >
</head>
<body class='pod'>
<!--
  generated by Pod::Simple::HTML v3.01,
  using Pod::Simple::PullParser v2.02,
  under Perl v5.008002 at Thu Aug  5 13:56:22 2004 GMT.

 If you want to change this HTML document, you probably shouldn't do that
   by changing it directly.  Instead, see about changing the calling options
   to Pod::Simple::HTML, and/or subclassing Pod::Simple::HTML,
   then reconverting this document from the Pod source.
   When in doubt, email the author of Pod::Simple::HTML for advice.
   See 'perldoc Pod::Simple::HTML' for more info.

-->

<!-- start doc -->
<a name='___top' class='dummyTopAnchor' ></a>

<h1><a class='u' href='#___top' title='click to go to top of document'
name="NAME"
>NAME</a></h1>

<p>tcsort - topological sort</p>

<h1><a class='u' href='#___top' title='click to go to top of document'
name="SYNOPSIS"
>SYNOPSIS</a></h1>

<pre lang='und' xml:lang='und'>  tcsort [filename]</pre>

<h1><a class='u' href='#___top' title='click to go to top of document'
name="DESCRIPTION"
>DESCRIPTION</a></h1>

<blockquote>
<p>Does a topological sort of input pairs.</p>

<p>For a more complete description, see the tsort(1) man page, For an explanation of the algorithm, see the <i>Work</i> column in the October, 1998, issue of SunExpert, or the references given below.</p>
</blockquote>

<h1><a class='u' href='#___top' title='click to go to top of document'
name="OPTIONS_AND_ARGUMENTS"
>OPTIONS AND ARGUMENTS</a></h1>

<dl>
<dt><a name="[-b|-d]"
><b>[-b|-d]</b></a></dt><p class="pad"></p>

<dd>breadth-first or depth-first (default) traversal</dd><p class="pad"></p>

<dt><a name="filename"
><b>filename</b></a></dt><p class="pad"></p>

<dd>Optional input file. Input format is pairs of white-space-separated fields, one pair per line. Each field is the name of a node.</dd><p class="pad"></p>

<dd>Output is the topologically sorted list of nodes.</dd><p class="pad"></p>

<dd>Ignores lines without at least two fields. Ignores all fields on the line except the first two.</dd><p class="pad"></p>
</dl>

<h1><a class='u' href='#___top' title='click to go to top of document'
name="AUTHOR"
>AUTHOR</a></h1>

<pre lang='und' xml:lang='und'>  Jeffrey S. Haemer</pre>

<h1><a class='u' href='#___top' title='click to go to top of document'
name="SEE_ALSO"
>SEE ALSO</a></h1>

<p>tsort(1), tcsh(1), tchrist(1)</p>

<p>Algorithm stolen from Jon Bentley (<i>More Programming Pearls</i>, pp. 20-23), who, in turn, stole it from Don Knuth (<i>Art of Computer Programming, volume 1: Fundamental Algorithms</i>, Section 2.2.3)</p>

<!-- end doc -->

</body></html>