-
Notifications
You must be signed in to change notification settings - Fork 0
/
opti.c
77 lines (69 loc) · 1.83 KB
/
opti.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
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* opti.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: mhaziza <mhaziza@student.42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2017/02/17 17:00:33 by mhaziza #+# #+# */
/* Updated: 2017/02/20 17:02:09 by mhaziza ### ########.fr */
/* */
/* ************************************************************************** */
#include "lem_in.h"
int get_id_room(char **ids, char *name)
{
int i;
i = 0;
while (ids && ids[i])
{
if (!ft_strcmp(ids[i], name))
return (i);
i++;
}
return (-1);
}
char *get_room_by_id(t_anthill *ah, int id)
{
if (ah && ah->rooms && id < ah->nb_rooms)
return (ah->rooms[id]);
return (NULL);
}
int remove_shorter(t_anthill *ah, t_bfs *bfs)
{
int i;
int j;
i = 0;
while (++i < bfs->deg[bfs->p])
{
j = 0;
while (j < ah->nb_rooms)
{
ah->adjacency[j][bfs->path[i]] = 0;
ah->adjacency[bfs->path[i]][j] = 0;
j++;
}
}
free(bfs->path);
call_bfs(ah, bfs, 1);
if (bfs->deg[bfs->p] > 1)
print_path(ah, bfs);
return (bfs->deg[bfs->p]);
}
int is_optimisable(t_anthill *ah)
{
int slink;
int plink;
int i;
i = 0;
slink = 0;
plink = 0;
while (i < ah->nb_rooms)
{
slink += ah->adjacency[ah->id_start][i];
plink += ah->adjacency[ah->id_end][i];
i++;
}
if (MIN(slink, plink) > 1)
return (MIN(slink, plink));
return (0);
}