diff options
| author | Bill Fumerola <billf@FreeBSD.org> | 1999-03-20 21:24:18 +0000 |
|---|---|---|
| committer | Bill Fumerola <billf@FreeBSD.org> | 1999-03-20 21:24:18 +0000 |
| commit | bc47530cab770a098b089589f769eea314ada417 (patch) | |
| tree | 902b0038290626f3e0ccfd35be1d80a8b3359776 /usr.bin/tsort | |
| parent | 7785c4f28061636d03cb97386c0385e4eb3f8b99 (diff) | |
| download | src-test-bc47530cab770a098b089589f769eea314ada417.tar.gz src-test-bc47530cab770a098b089589f769eea314ada417.zip | |
An even number of nodes, not node pairs are required for tsort(1) to work.
Pairs are inherently even.
PR: docs/9264
Submitted by: NAGAO Tadaaki <nagao@iij.ad.jp>
Notes
Notes:
svn path=/head/; revision=44919
Diffstat (limited to 'usr.bin/tsort')
| -rw-r--r-- | usr.bin/tsort/tsort.1 | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/usr.bin/tsort/tsort.1 b/usr.bin/tsort/tsort.1 index 5ac78ce551fda..12a4d6d0e5601 100644 --- a/usr.bin/tsort/tsort.1 +++ b/usr.bin/tsort/tsort.1 @@ -56,7 +56,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 node pairs. +be an even number of nodes. .Pp Presence of a node in a graph can be represented by an arc from the node to itself. |