[BACK]Return to tsort.1 CVS log [TXT][DIR] Up to [local] / src / usr.bin / tsort

Diff for /src/usr.bin/tsort/tsort.1 between version 1.7 and 1.8

version 1.7, 2001/03/26 22:53:33 version 1.8, 2001/04/07 14:17:37
Line 81 
Line 81 
 Use  Use
 .Ar file ,  .Ar file ,
 which holds an ordered list of nodes, to resolve ambiguities.  which holds an ordered list of nodes, to resolve ambiguities.
   In case of duplicates, the first entry is chosen.
 .It Fl l  .It Fl l
 Search for and display the longest cycle.  Search for and display the longest cycle.
 .It Fl q  .It Fl q
 Do not display informational messages about cycles.  This is primarily  Do not display informational messages about cycles.
 intended for building libraries, where optimal ordering is not critical,  This is primarily intended for building libraries, where optimal ordering
 and cycles occur often.  is not critical, and cycles occur often.
 .It Fl r  .It Fl r
 Reverse the ordering relation.  Reverse the ordering relation.
 .It Fl v  .It Fl v
 Inform on the exact number of edges broken while breaking cycles.  Inform on the exact number of edges broken while breaking cycles.
   If a hints file was used, inform on seen nodes absent from that file.
 .It Fl w  .It Fl w
 Exit with exit code the number of cycles  Exit with exit code the number of cycles
 .Nm  .Nm
Legend:
Removed from v.1.7  
changed lines
  Added in v.1.8