blob: f28f8aba5ecab51d161d4d889f848cc50dd592df (
plain) (
tree)
|
|
#include <stdio.h>
#include <time.h>
#include <stdlib.h>
#include "common.h"
#include "structs.h"
#include "dfs.h"
int main(int argc, char * argv[]){
struct data * d;
struct front_item * b;
if(argc!=2){
printf("Wrong number of arguments!\n");
printf("Example usage: %s data_file\n",argv[0]);
return 0;
}
d = input(argv[1]);
/* srand() and qsort data */
srand(time(NULL));
qsort(d->items, d->N, sizeof(struct item), cmp_items_random);
clock_t t = clock();
b = dfs(d);
t = clock() - t;
printf("%f,%d\n",((float)t)/CLOCKS_PER_SEC,len_front(b));
print_front(b);
free_front(b);
free_data(d);
return 0;
}
|