IT WORKS !

functionning ./lem_in that can read maps and display ants path
still need to clean leaks
still need remove debug info
This commit is contained in:
Tanguy MAZE
2019-04-09 19:09:29 +02:00
parent 434b629055
commit 3b893147e5
11 changed files with 364 additions and 235 deletions

View File

@@ -6,20 +6,20 @@
/* By: tmaze <tmaze@student.42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2019/04/06 11:37:56 by tmaze #+# #+# */
/* Updated: 2019/04/08 13:40:41 by tmaze ### ########.fr */
/* Updated: 2019/04/09 18:54:54 by tmaze ### ########.fr */
/* */
/* ************************************************************************** */
#include "lem_in.h"
t_ants *add_ant(t_ants **ants, int *nb_ant, int nb_path, t_ind **paths)
t_ants *add_ant(t_ants **ants, int nb_ant, int nb_path, t_ind **paths)
{
t_ants *new;
t_ants *it;
if ((new = (t_ants*)ft_memalloc(sizeof(t_ants))) != NULL)
{
new->nb_ant = *nb_ant++;
new->nb_ant = nb_ant;
new->nb_path = nb_path;
new->nb_node = paths[nb_path]->index;
new->end = 0;
@@ -59,7 +59,7 @@ t_node *get_node(t_lmdata *data, int index)
return (it);
}
void push_ants(t_lmdata *data, t_ind **paths, int nb_paths, int nb_ants)
void push_ants(t_lmdata *data, t_ind **paths, int nb_paths)
{
t_ants *ants;
t_ants *it;
@@ -69,24 +69,29 @@ void push_ants(t_lmdata *data, t_ind **paths, int nb_paths, int nb_ants)
char has_start[nb_paths];
ant_c = 1;
ants = NULL;
ft_bzero(has_start, nb_paths);
if (add_ant(&ants, &ant_c, 0, paths) == NULL)
if (add_ant(&ants, ant_c, 0, paths) == NULL)
return ;
ant_c++;
has_start[0] = 1;
while (ants)
{
i = 0;
while (i < nb_paths)
if (ant_c <= nb_ants && !has_start[i])
{
if (ant_c <= data->nbants && !has_start[i])
{
if (add_ant(&ants, &ant_c, i, paths) == NULL)
if (add_ant(&ants, ant_c, i, paths) == NULL)
{
del_ants(&ants);
return ;
}
ant_c++;
has_start[i] = 1;
i++;
}
i++;
}
it = ants;
while (it)
{
@@ -110,7 +115,7 @@ void push_ants(t_lmdata *data, t_ind **paths, int nb_paths, int nb_ants)
ft_memdel((void**)&it);
}
it = ants;
while (it->next && it->next->end)
while (it && it->next && it->next->end)
{
tmp = it->next;
it->next = tmp->next;