summaryrefslogtreecommitdiff
path: root/usr.bin/tsort/tsort.1
diff options
context:
space:
mode:
Diffstat (limited to 'usr.bin/tsort/tsort.1')
-rw-r--r--usr.bin/tsort/tsort.16
1 files changed, 3 insertions, 3 deletions
diff --git a/usr.bin/tsort/tsort.1 b/usr.bin/tsort/tsort.1
index 5ade4b9db05..2ec6ac93395 100644
--- a/usr.bin/tsort/tsort.1
+++ b/usr.bin/tsort/tsort.1
@@ -1,4 +1,4 @@
-.\" $OpenBSD: tsort.1,v 1.13 2003/06/03 02:56:20 millert Exp $
+.\" $OpenBSD: tsort.1,v 1.14 2003/06/10 09:12:12 jmc Exp $
.\" $NetBSD: tsort.1,v 1.6 1996/01/17 20:37:49 mycroft Exp $
.\"
.\" Copyright (c) 1990, 1993, 1994
@@ -83,8 +83,8 @@ In case of duplicates, the first entry is chosen.
Search for and display the longest cycle.
Can take a very long time, as it may need to solve an NP-complete problem.
.It Fl q
-Do not display informational messages about cycles.
-This is primarily intended for building libraries, where optimal ordering
+Do not display informational messages about cycles.
+This is primarily intended for building libraries, where optimal ordering
is not critical, and cycles occur often.
.It Fl r
Reverse the ordering relation.