nitpicks.
Reviewed by: phk Submitted by: "Philippe Charnier" <charnier@lirmm.fr>
This commit is contained in:
parent
f2eff4c0ab
commit
8cd6893074
Notes:
svn2git
2020-12-20 02:59:44 +00:00
svn path=/head/; revision=16281
@ -42,6 +42,7 @@
|
||||
.Nd topological sort of a directed graph
|
||||
.Sh SYNOPSIS
|
||||
.Nm tsort
|
||||
.Op Fl d
|
||||
.Op Fl l
|
||||
.Op Ar file
|
||||
.Sh DESCRIPTION
|
||||
@ -66,6 +67,8 @@ Cycles are reported on standard error.
|
||||
.Pp
|
||||
The options are as follows:
|
||||
.Bl -tag -width Ds
|
||||
.It Fl d
|
||||
Turn on debugging.
|
||||
.It Fl l
|
||||
Search for and display the longest cycle.
|
||||
Can take a very long time.
|
||||
|
@ -32,6 +32,8 @@
|
||||
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
||||
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
||||
* SUCH DAMAGE.
|
||||
*
|
||||
* $Id$
|
||||
*/
|
||||
|
||||
#ifndef lint
|
||||
@ -424,6 +426,6 @@ find_cycle(from, to, longest_len, depth)
|
||||
void
|
||||
usage()
|
||||
{
|
||||
(void)fprintf(stderr, "usage: tsort [-l] [file]\n");
|
||||
(void)fprintf(stderr, "usage: tsort [-dl] [file]\n");
|
||||
exit(1);
|
||||
}
|
||||
|
Loading…
Reference in New Issue
Block a user