Linux and UNIX Man Pages

Linux & Unix Commands - Search Man Pages

tsort(1) [netbsd man page]

TSORT(1)						    BSD General Commands Manual 						  TSORT(1)

NAME
tsort -- topological sort of a directed graph SYNOPSIS
tsort [-l] [-q] [file] DESCRIPTION
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. 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 node names. 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: -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
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. BSD
April 1, 1994 BSD

Check Out this Related Man Page

TSORT(1)						    BSD General Commands Manual 						  TSORT(1)

NAME
tsort -- topological sort of a directed graph 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 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. BUGS
The tsort utility does not recognize multibyte characters. BSD
December 27, 2006 BSD
Man Page

4 More Discussions You Might Find Interesting

1. UNIX for Dummies Questions & Answers

Stopping a command during the cycle

Hi, Two things really: 1) can you input a code to pause a program until a key is pressed? 2) can you stop a command during a cycle? (7 Replies)
Discussion started by: chapmana
7 Replies

2. Shell Programming and Scripting

for cycle

Hello, I have a question: is there a way to have a "for" cycle done a certain number of times. For example in c++ I can do this: for (i=o;i<10;i++) and the cycle will be repeated 10 times. in UNIX for example I do this: for i in `cat /etc/host` do done and the cycle will be repeated... (6 Replies)
Discussion started by: jcpetela
6 Replies

3. UNIX for Advanced & Expert Users

Expert Opinion

This perhaps does not belong in ths category; apologies, however, we have a heated debate going and your input will decide the result. Should UNIX (HP, AIX, etc) be rebooted following a monthly cycle (Every month, or a qtr, etc.). We have some UX admins (grumps) who say they have seen a UX... (6 Replies)
Discussion started by: rsheikh
6 Replies

4. Programming

[C] deleting node from graph

Using adjacency lists, I implemented this operation as follows: /* remove the first node it finds with value 'val' in L list */ edge *removeEdge (edge *L, int val) { if( !L ) return NULL; if( L->key == val ) { edge *temp = L->next; free (L); ... (5 Replies)
Discussion started by: Luke Bonham
5 Replies