===================================================================
RCS file: /cvsrepo/anoncvs/cvs/src/usr.bin/tsort/tsort.1,v
retrieving revision 1.22
retrieving revision 1.23
diff -u -r1.22 -r1.23
--- src/usr.bin/tsort/tsort.1	2010/09/03 11:09:29	1.22
+++ src/usr.bin/tsort/tsort.1	2012/03/29 22:04:28	1.23
@@ -1,4 +1,4 @@
-.\"	$OpenBSD: tsort.1,v 1.22 2010/09/03 11:09:29 jmc Exp $
+.\"	$OpenBSD: tsort.1,v 1.23 2012/03/29 22:04:28 jmc Exp $
 .\"	$NetBSD: tsort.1,v 1.6 1996/01/17 20:37:49 mycroft Exp $
 .\"
 .\" Copyright (c) 1990, 1993, 1994
@@ -33,7 +33,7 @@
 .\"
 .\"     @(#)tsort.1	8.3 (Berkeley) 4/1/94
 .\"
-.Dd $Mdocdate: September 3 2010 $
+.Dd $Mdocdate: March 29 2012 $
 .Dt TSORT 1
 .Os
 .Sh NAME
@@ -58,7 +58,7 @@
 is given.
 .Pp
 Node names in the input are separated by white space and there must
-be an even number of node pairs.
+be an even number of node names.
 .Pp
 Presence of a node in a graph can be represented by an arc from the node
 to itself.