GSP
Quick Navigator

Search Site

Unix VPS
A - Starter
B - Basic
C - Preferred
D - Commercial
MPS - Dedicated
Previous VPSs
* Sign Up! *

Support
Contact Us
Online Help
Handbooks
Domain Status
Man Pages

FAQ
Virtual Servers
Pricing
Billing
Technical

Network
Facilities
Connectivity
Topology Map

Miscellaneous
Server Agreement
Year 2038
Credits
 

USA Flag

 

 

Man Pages


Manual Reference Pages  -  TSORT (1)

NAME

tsort - topological sort of a directed graph

CONTENTS

Synopsis
Description
See Also
History
Bugs

SYNOPSIS

tsort [-dlq] [file]

DESCRIPTION

The tsort utility 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.

There must be an even number of nodes in the input. Node names specified on the same line should be white space separated.

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.

The options are as follows:
-d Turn on debugging.
-l Search for and display the longest cycle. Can take a very long time.
-q Do not display informational messages about cycles. This is primarily intended for building libraries, where optimal ordering is not critical, and cycles occur often.

SEE ALSO

ar(1)

HISTORY

The tsort command appeared in AT&T v7 . This tsort command and manual page are derived from sources contributed to Berkeley by
.An Michael Rendell of Memorial University of Newfoundland.

BUGS

The tsort utility does not recognize multibyte characters.
Search for    or go to Top of page |  Section 1 |  Main Index


Powered by GSP Visit the GSP FreeBSD Man Page Interface.
Output converted with manServer 1.07.