kill to large path, no point to keep it

Author: Allan Barrielle

map/tst_sansbig

@@ -0,0 +1,34 @@
+10
+##start
+1 6 9
+2 4 7
+3 5 6
+4 5 6
+5 4 5
+6 4 7
+7 5 6
+8 5 6
+9 4 5
+11 4 5
+12 4 7
+13 5 6
+14 5 6
+15 4 5
+##end
+10 4 5
+1-11
+1-8
+2-3
+3-6
+3-4
+6-7
+4-7
+4-5
+5-10
+8-9
+9-10
+11-12
+12-13
+13-14
+13-15
+12-10

srcs/print.c

@@ -18,7 +18,8 @@ void	print_path(t_path *path)
 		return ;
 	while (path)
 	{
-		ft_printf("[%s-%d]", path->name, path->size);
+		// ft_printf("[%s-%d]", path->name, path->size);
+		ft_printf("%s", path->name);
 		if (path->next)
 			ft_printf("->");
 		path = path->next;

srcs/send.c

@@ -51,7 +51,7 @@ void 	print_ants(int bc, int ants, char *name)
 	ft_printf("L%d-%s ", ants, name);
 	ft_putstr(RESET);
 }
-void 	sort_lists(t_path **p, int max_path)
+void 	sort_lists(t_path **p, int *max_path)
 {
 	int i;
 	t_path **begin;
@@ -61,9 +61,9 @@ void 	sort_lists(t_path **p, int max_path)
 	i = 0;
 	begin = p;
 	tmp = NULL;
-	while(i < max_path)
+	while(i < *(max_path))
 	{
-		if (i + 1 < max_path && (p[i]->size > p[i + 1]->size))
+		if (i + 1 < *(max_path) && (p[i]->size > p[i + 1]->size))
 		{
 			tmp = p[i];
 			p[i] = p[i + 1];
@@ -72,6 +72,21 @@ void 	sort_lists(t_path **p, int max_path)
 		}
 		i++;
 	}
+	i = 0;
+	p = begin;
+	while(i < *(max_path))
+	{
+		if (i + 1 < *(max_path) && (p[i + 1]->size > (p[0]->size + 2)))
+		{
+			*(max_path) = i + 1;
+			p[i + 1] = NULL;
+			p = begin;
+			return ;
+			// free(p[i + 1]);
+			// i = 0;
+		}
+		i++;
+	}
 	p = begin;
 }
 void	handles_path(t_path **p, t_ant *a, int max_path)
@@ -91,11 +106,18 @@ void	handles_path(t_path **p, t_ant *a, int max_path)
 	while(i < max_path)
 	{	
 		reverse_list(&p[i],a);
-		tmp[i] = p[i];
+		// tmp[i] = p[i];
 		i++;
 	}
 	if (max_path > 1)
-	sort_lists(p,max_path);
+	sort_lists(p,&max_path);
+	i = 0;
+	ft_printf("\n\n");
+	while(i <= max_path)
+	{
+		tmp[i] = p[i];
+		i++;
+	}
 	i = 0;
 	while(end <= a->ant)
 	{
@@ -107,7 +129,7 @@ void	handles_path(t_path **p, t_ant *a, int max_path)
 				{
 					end++;
 					p[i]->ants = end;
-					ft_printf("[1]");
+					// ft_printf("[1]");
 					print_ants(a->bonus_color, p[i]->ants,p[i]->name);
 					if (end == a->ant)
 						return ;
@@ -118,14 +140,14 @@ void	handles_path(t_path **p, t_ant *a, int max_path)
 					start--;
 					ants++;
 					p[i]->ants = ants;
-					ft_printf("[2]");
+					// ft_printf("[2]");
 					print_ants(a->bonus_color, p[i]->ants,p[i]->name);
 				}
 				else if (p[i]->next && p[i]->next->ants > 0 && p[i]->next->start != 1)
 				{
 					p[i]->ants = p[i]->next->ants;
 					p[i]->next->ants = 0;
-					ft_printf("[3]");
+					// ft_printf("[3]");
 					print_ants(a->bonus_color, p[i]->ants,p[i]->name);
 				}
 				p[i] = p[i]->next;

tests/big

@@ -1,4 +1,4 @@
-1
+100
 ##start
 start 0 1
 ##end