1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
|
#include <stdio.h>
#include <time.h>
#include <stdlib.h>
#include <string.h>
#include "common.h"
#include "structs.h"
#include "dfs.h"
#include "random_heuristic.h"
#include "nem_ull.h"
int main(int argc, char * argv[]){
struct data * data;
struct front_item * front = NULL;
struct online_return ret;
if(argc!=5){
printf("Wrong number of arguments!\n");
printf("Example usage: %s algorithm1 algorithm2 sort_method data_file\n",argv[0]);
return 0;
}
data = input(argv[4]);
/* Sort data */
srand(time(NULL));
if(strcmp(argv[3], "random") == 0) {
qsort(data->items, data->N, sizeof(struct item), cmp_items_random);
} else if(strcmp(argv[3], "ratio") == 0) {
qsort(data->items, data->N, sizeof(struct item), cmp_items_ratio);
}
clock_t t = clock();
/* Choose algorithm1 */
if(strcmp(argv[1], "dfs") == 0) {
ret = dfs_online(data, NULL, NULL, 20);
} else if(strcmp(argv[1], "random_heuristic") == 0) {
ret = random_heuristic_online(data, NULL, NULL);
}
/* Run algorithm2, if it hasn't finished yet*/
if(ret.tree!=NULL){
if(strcmp(argv[2], "dfs") == 0) {
ret = dfs_online(data, ret.front, ret.tree, 100);
} else if(strcmp(argv[2], "random_heuristic") == 0) {
ret = random_heuristic_online(data, ret.front, ret.tree);
}
}
front = ret.front;
/* Remove first item from front (only a placeholder) */
front=front->next;
free(front->prev);
front->prev = NULL;
t = clock() - t;
printf("%f,%d\n",((float)t)/CLOCKS_PER_SEC,len_front(front));
print_front(front);
free_front(front);
free_data(data);
return 0;
}
|
