On Mar 28 15:51:16, Jason McIntyre wrote: > On Wed, Mar 28, 2012 at 11:24:49AM +0200, Jan Stary wrote: > > > > Index: tsort.1 > > =================================================================== > > RCS file: /cvs/src/usr.bin/tsort/tsort.1,v > > retrieving revision 1.22 > > diff -u -p -r1.22 tsort.1 > > --- tsort.1 3 Sep 2010 11:09:29 -0000 1.22 > > +++ tsort.1 28 Mar 2012 09:21:24 -0000 > > @@ -57,8 +57,8 @@ Input is taken from the named > > 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 node pairs. > > +Node names in the input are separated by white space > > +and they must come in pairs. > > .Pp > > Presence of a node in a graph can be represented by an arc from the node > > to itself. > > netbsd used a simpler fix, and i propose using that instead (freebsd > rewrote the text badly).
> Index: tsort.1 > =================================================================== > RCS file: /cvs/src/usr.bin/tsort/tsort.1,v > retrieving revision 1.22 > diff -u -r1.22 tsort.1 > --- tsort.1 3 Sep 2010 11:09:29 -0000 1.22 > +++ tsort.1 28 Mar 2012 14:49:51 -0000 > @@ -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. I agree that this is better. The error message in tsort.c (that complains about "odd number of pairs") should be changed similarly, too.
