-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathft_ways.c
133 lines (124 loc) · 3.46 KB
/
ft_ways.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_ways.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: ychufist <[email protected]> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2019/02/19 18:26:31 by ychufist #+# #+# */
/* Updated: 2019/03/05 19:23:37 by ychufist ### ########.fr */
/* */
/* ************************************************************************** */
#include "lem_in.h"
void get_way_dop(t_farm *farm, t_list_room **new)
{
if (farm->col != -1)
farm->ways[farm->ways_amount]->color = farm->colors[farm->col++];
if (farm->col == 5)
farm->col = 0;
farm->ways_amount++;
free_list(new);
}
void get_way(t_farm *farm, t_list_room *way, int flag)
{
t_list_room *rm;
t_list_room *dop;
t_list_room *new;
bzero_ways(farm);
farm->ways[farm->ways_amount] = ft_list_room_new(farm->rooms[
farm->start_room_id]);
dop = farm->ways[farm->ways_amount];
rm = way->prev;
while (rm->id != farm->end_room_id)
{
farm->ways[farm->ways_amount]->next = ft_list_room_new(farm->rooms
[rm->id]);
farm->ways[farm->ways_amount] = farm->ways[farm->ways_amount]->next;
farm->rooms[rm->id].flag = 2;
rm = rm->prev;
}
new = rm;
farm->ways[farm->ways_amount]->next = ft_list_room_new(farm->rooms[
rm->id]);
farm->ways[farm->ways_amount] = dop;
farm->ways[farm->ways_amount]->size = ft_list_size(farm->ways[
farm->ways_amount]) - 1;
get_way_dop(farm, &new);
find_ways(farm, flag);
}
int find_ways_dop(t_farm *farm, t_list_room **way,
t_list_room *dop2, t_point i)
{
if ((*way)->id != farm->end_room_id && (*way)->id != -1)
farm->rooms[(*way)->id].flag = 1;
if ((*way)->links_amount == 1 && (*way)->links[0] ==
farm->start_room_id)
{
(*way)->next = ft_list_room_new(farm->rooms[dop2->links[i.x]]);
(*way) = (*way)->next;
(*way)->prev = dop2;
get_way(farm, (*way), 1);
return (0);
}
if (dop2->links[i.x] != farm->end_room_id)
{
(*way)->next = ft_list_room_new(farm->rooms[dop2->links[i.x]]);
(*way) = (*way)->next;
(*way)->prev = dop2;
if ((*way)->id == farm->start_room_id)
{
get_way(farm, (*way), i.y);
return (0);
}
}
return (1);
}
void find_ways(t_farm *farm, int flag)
{
t_point i;
t_list_room *way;
t_list_room *dop2;
t_list_room *dop;
way = ft_list_room_new(farm->rooms[farm->end_room_id]);
dop = way;
dop2 = way;
i.y = flag;
while (dop2)
{
if (flag == 1)
break ;
i.x = -1;
while (++i.x < dop2->links_amount)
{
if (farm->rooms[dop2->links[i.x]].flag != 1 && farm->rooms[
dop2->links[i.x]].flag != 2 && !find_ways_dop(farm, &way, dop2, i))
return ;
}
dop2 = dop2->next;
}
free_list(&dop);
bzero_ways(farm);
}
void print_ways(t_farm farm)
{
int i;
t_list_room *ways;
i = 0;
ft_printf("Amount of ways: %d\n", farm.ways_amount);
while (i < farm.ways_amount)
{
ways = farm.ways[i];
ft_printf("%d) %d : ", i + 1, ways->size);
while (ways)
{
ft_printf("%s -> ", ways->name);
if (ways->next)
ways = ways->next;
else
break ;
}
ft_printf("\n");
i++;
}
ft_printf("\n");
}