>Number:         185
>Category:       misc
>Synopsis:       tsort(1) man-page is unclear/incorrect
>Confidential:   no
>Severity:       non-critical
>Priority:       low
>Responsible:    gnats-admin (Misc Bug People)
>State:          open
>Class:          doc-bug
>Submitter-Id:   net
>Arrival-Date:   Thu Mar 31 20:05:09 1994
>Originator:     Mark Weaver
>Organization:
--------------------------------------------------------------------
Email: Mark_Weaver@brown.edu           | Brown University
PGP Key: finger mhw@cs.brown.edu       | Dept of Computer Science
>Release:        
>Environment:

System: NetBSD cis-ts3-slip4.cis.brown.edu 0.9a EXCELSIOR#0 i386

>Description:

	tsort(1) man page incorrectly implies that there must be an
	even number of nodes.  They meant to say that there must be
	an even number of words in the input file, since it is composed
	of node-pairs describing the graph.  It is very badly worded
	though.

>How-To-Repeat:

	man tsort

>Fix:

diff -u  src/usr.bin/tsort/tsort.1.mhw1 src/usr.bin/tsort/tsort.1
--- src/usr.bin/tsort/tsort.1.mhw1	Fri Feb  4 05:15:57 1994
+++ src/usr.bin/tsort/tsort.1	Wed Mar 30 22:36:20 1994
@@ -53,8 +53,7 @@
 or from standard input if no file
 is given.
 .Pp
-Node names in the input are separated by white space and there must be an
-even number of nodes.
+Node names in the input are separated by white space.
 .Pp
 Presence of a node in a graph can be represented by an arc from the node
 to itself.
>Audit-Trail:
>Unformatted:


------------------------------------------------------------------------------