icon Top 9 categories map      RocketAware >


Tips: Browse or Search all pages for efficient awareness of more than 6000 of the most popular reusable and open source applications, functions, libraries, and FAQs.

The "RKT couplings" below include links to source code, updates, additional information, advice, FAQs, and overviews.


Search all pages


By activity
Professions, Sciences, Humanities, Business, ...

User Interface
Text-based, GUI, Audio, Video, Keyboards, Mouse, Images,...

Text Strings
Conversions, tests, processing, manipulation,...

Integer, Floating point, Matrix, Statistics, Boolean, ...

Algorithms, Memory, Process control, Debugging, ...

Stored Data
Data storage, Integrity, Encryption, Compression, ...

Networks, protocols, Interprocess, Remote, Client Server, ...

Hard World
Timing, Calendar and Clock, Audio, Video, Printer, Controls...

File System
Management, Filtering, File & Directory access, Viewers, ...


RocketLink!--> Man page versions: OpenBSD FreeBSD NetBSD RedHat Solaris Others

TSORT(1)                   OpenBSD Reference Manual                   TSORT(1)

     tsort - topological sort of a directed graph

     tsort [-l] [-q] [file]

     tsort 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 file, or from standard input if no file is

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

     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

     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:

     -l      Search for and display the longest cycle.  Can take a very long

     -q      Do not display informational messages about cycles.  This is pri-
             marily intended for building libraries, where optimal ordering is
             not critical, and cycles occur often.


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

OpenBSD 2.6                      April 1, 1994                               1

Source: OpenBSD 2.6 man pages. Copyright: Portions are copyrighted by BERKELEY
SOFTWARE DESIGN, INC., The Regents of the University of California, Massachusetts
Institute of Technology, Free Software Foundation, FreeBSD Inc., and others.

(Corrections, notes, and links courtesy of RocketAware.com)

[Detailed Topics]
FreeBSD Sources for tsort(1)
OpenBSD sources for tsort(1)

[Overview Topics]

Up to: Persistent data storage, databases - (data files, databases)
Up to: Trees and Graphs - Data structures implementing Trees and Graphs. (Each element references 0 or more other elements)

RocketLink!--> Man page versions: OpenBSD FreeBSD NetBSD RedHat Solaris Others

Rapid-Links: Search | About | Comments | Submit Path: RocketAware > tsort.1/
RocketAware.com is a service of Mib Software
Copyright 1999, Forrest J. Cavalier III. All Rights Reserved.
We welcome submissions and comments