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

Diff for /src/usr.bin/tsort/tsort.c between version 1.19 and 1.20

version 1.19, 2004/08/05 10:59:42 version 1.20, 2006/01/20 23:10:19
Line 16 
Line 16 
  * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.   * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
  */   */
   
 #include <sys/types.h>  
 #include <assert.h>  #include <assert.h>
 #include <ctype.h>  #include <ctype.h>
 #include <err.h>  #include <err.h>
 #include <limits.h>  #include <limits.h>
 #include <stddef.h>  #include <stddef.h>
 #include <ohash.h>  
 #include <stdio.h>  #include <stdio.h>
   #include <stdint.h>
 #include <stdlib.h>  #include <stdlib.h>
 #include <string.h>  #include <string.h>
 #include <sysexits.h>  #include <sysexits.h>
 #include <unistd.h>  #include <unistd.h>
   #include <ohash.h>
   
 /* The complexity of topological sorting is O(e), where e is the  /* The complexity of topological sorting is O(e), where e is the
  * size of input.  While reading input, vertices have to be identified,   * size of input.  While reading input, vertices have to be identified,
Legend:
Removed from v.1.19  
changed lines
  Added in v.1.20