path: root/src/main/online.c

#include <stdio.h>
#include <time.h>
#include <stdlib.h>
#include <string.h>
#include <sys/time.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;
  ret.tree = NULL;
  ret.front = NULL;

  if(argc!=6){
    printf("Wrong number of arguments!\n");
    printf("Example usage: %s algorithm1 algorithm2 sort_method cut_pointa data_file\n", argv[0]);
    return 0;
  }

  data = input(argv[5]);

  /* Sort data */
  struct timeval tv;
  gettimeofday(&tv, NULL);
  srand(tv.tv_sec + tv.tv_usec);

  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);
  }

  printf("%d\n", atoi(argv[4]));
  clock_t t = clock();
  /* Choose algorithm1 */
  if(strcmp(argv[1], "dfs") == 0) {
    ret = dfs_online(data, NULL, NULL, atoi(argv[4]));
  } 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 && ret.front != 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;
}