main.c

/*
** main.c for lem_in in /home/thibaud/rendu/lem_in
**
** Made by thixbaud
** Login   <thibaud@epitech.net>
**
** Started on  Sat Apr 12 23:46:01 2014 thibaud
** Last update Sat May  3 03:46:53 2014 thibaud
*/

#include "lem_in.h"

int		main(void)
{
  t_all		*p;

  p = parse();
  my_show_map(p->map);
  algo(p->arc, p->room, p->ants);
  sfree(p->map);
  free_list(p->room);
  free_arc(p->arc);
  free(p);
  return (0);
}

void		my_show_map(char **map)
{
  int		i;

  i = 0;
  while (map != NULL && map[i])
    printf("%s\n", map[i++]);
}

void		algo(t_arc *arc, t_lem *list, int ants)
{
  t_graphe	*graphe;
  t_way		*ways;

  ways = NULL;
  graphe = new_graphe();
  while (arc)
    {
      insert_arc(graphe, arc->first_room, arc->second_room);
      arc = arc->next;
    }
  ways = get_ways(graphe, 1, my_list_size(list), ways);
  free_graphe(graphe);
  fill_ways(ways, ants);
  run_lem_in(ways, list);
  free_ways(ways);
}

void		no_map()
{
  printf("No map.\n");
  exit(EXIT_FAILURE);
}

void		no_arc()
{
  printf("No rooms are linked.\n");
  exit(EXIT_FAILURE);
}