1 files changed, 64 insertions, 0 deletions
diff --git a/src/main/online.c b/src/main/online.c
new file mode 100644
index 0000000..ba8a94c
--- /dev/null
+++ b/src/main/online.c
@@ -0,0 +1,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;
+}