-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
10 changed files
with
234 additions
and
108 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,65 @@ | ||
| /* ************************************************************************** */ | ||
| /* */ | ||
| /* ::: :::::::: */ | ||
| /* free_all.c :+: :+: :+: */ | ||
| /* +:+ +:+ +:+ */ | ||
| /* By: eserebry <eserebry@student.42.fr> +#+ +:+ +#+ */ | ||
| /* +#+#+#+#+#+ +#+ */ | ||
| /* Created: 2017/10/30 06:48:54 by eserebry #+# #+# */ | ||
| /* Updated: 2017/11/26 03:11:38 by eserebry ### ########.fr */ | ||
| /* */ | ||
| /* ************************************************************************** */ | ||
|
|
||
| #include "../includes/lem_in.h" | ||
|
|
||
| void delete_links(t_link *links) | ||
| { | ||
| if (links) | ||
| { | ||
| delete_links(links->next); | ||
| free(links); | ||
| } | ||
| } | ||
|
|
||
| void delete_rooms(t_room *rooms) | ||
| { | ||
| int x; | ||
|
|
||
| x = -1; | ||
| if (!rooms->door_names) | ||
| return ; | ||
| while (rooms->door_names[++x]) | ||
| ft_strdel(&rooms->door_names[x]); | ||
| ft_memdel((void*)&rooms->door_names); | ||
| } | ||
|
|
||
| void delete_path(t_lemin *lemin) | ||
| { | ||
| t_room *tmp; | ||
|
|
||
| tmp = lemin->rooms->next; | ||
| while (tmp) | ||
| { | ||
| if (lemin->rooms->door_names) | ||
| delete_rooms(lemin->rooms); | ||
| if (lemin->rooms->name) | ||
| ft_strdel(&lemin->rooms->name); | ||
| ft_memdel((void*)&lemin->rooms); | ||
| lemin->rooms = tmp; | ||
| tmp = tmp->next; | ||
| } | ||
| if (lemin->rooms->name) | ||
| ft_strdel(&lemin->rooms->name); | ||
| delete_rooms(lemin->rooms); | ||
| ft_memdel((void*)&lemin->rooms); | ||
| } | ||
|
|
||
| void free_all(t_lemin *lemin) | ||
| { | ||
| if (lemin->links) | ||
| delete_links(lemin->links); | ||
| if (lemin->rooms) | ||
| delete_path(lemin); | ||
| ft_strdel(&lemin->input); | ||
| ft_memdel((void*)&lemin); | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,84 @@ | ||
| /* ************************************************************************** */ | ||
| /* */ | ||
| /* ::: :::::::: */ | ||
| /* check_for_end.c :+: :+: :+: */ | ||
| /* +:+ +:+ +:+ */ | ||
| /* By: eserebry <eserebry@student.42.fr> +#+ +:+ +#+ */ | ||
| /* +#+#+#+#+#+ +#+ */ | ||
| /* Created: 2017/10/30 07:08:09 by eserebry #+# #+# */ | ||
| /* Updated: 2017/11/25 02:22:34 by eserebry ### ########.fr */ | ||
| /* */ | ||
| /* ************************************************************************** */ | ||
|
|
||
| #include "../includes/lem_in.h" | ||
|
|
||
| int room_end(t_lemin *lemin, t_room *tmp, int y) | ||
| { | ||
| tmp->path = 1; | ||
| tmp->pos = y + 1; | ||
| return (1); | ||
| } | ||
|
|
||
| int recursion(t_lemin *lemin, t_room *tmp, int y) | ||
| { | ||
| int x; | ||
|
|
||
| x = -1; | ||
| while (tmp->door_names[++x]) | ||
| { | ||
| if ((searching_path(lemin, tmp->door_names[x], y + 1)) == 1) | ||
| return (room_end(lemin, tmp, y)); | ||
| } | ||
| return (0); | ||
| } | ||
|
|
||
| int searching_path(t_lemin *lemin, char *door_name, int y) | ||
| { | ||
| t_room *tmp; | ||
|
|
||
| tmp = lemin->rooms; | ||
| while (tmp) | ||
| { | ||
| if (ft_strcmp(tmp->name, door_name) == 0) | ||
| { | ||
| if (tmp->checked == 1) | ||
| return (0); | ||
| tmp->checked = 1; | ||
| if (tmp->end == 1) | ||
| return (room_end(lemin, tmp, y)); | ||
| else | ||
| { | ||
| if (recursion(lemin, tmp, y)) | ||
| return (1); | ||
| } | ||
| } | ||
| tmp = tmp->next; | ||
| } | ||
| return (0); | ||
| } | ||
|
|
||
| /* | ||
| **looking for a possible path, if it's exist | ||
| */ | ||
|
|
||
| int validate_path(t_lemin *lemin, t_room *rooms) | ||
| { | ||
| t_room *tmp; | ||
| int x; | ||
| int y; | ||
|
|
||
| tmp = start_search(rooms); | ||
| y = 0; | ||
| tmp->checked = 1; | ||
| tmp->pos = y; | ||
| tmp->path = 1; | ||
| if (tmp->doors_num == 0) | ||
| return (0); | ||
| x = -1; | ||
| while (tmp->door_names[++x]) | ||
| { | ||
| if (searching_path(lemin, tmp->door_names[x], y)) | ||
| return (1); | ||
| } | ||
| return (0); | ||
| } |
Oops, something went wrong.