GitHub - ioleksiuk/Lem_in: Your ant colony must move from one point to another. But how to make it the shortest path possible? This project introduces you to graphing algorithms: your program will have to intelligently select the precise paths and movements that these ants must take.

ioleksiuk / Lem_in Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

Your ant colony must move from one point to another. But how to make it the shortest path possible? This project introduces you to graphing algorithms: your program will have to intelligently select the precise paths and movements that these ants must take.

0 stars 0 forks Branches Tags Activity

Star

Notifications

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 1 Commit
bonus		bonus
Makefile		Makefile
add_link.c		add_link.c
add_q_static.c		add_q_static.c
add_room.c		add_room.c
add_visited_static.c		add_visited_static.c
add_way.c		add_way.c
ant_number.c		ant_number.c
author		author
count_char.c		count_char.c
create_first_way.c		create_first_way.c
create_matrix.c		create_matrix.c
create_room_list.c		create_room_list.c
del_last_visited.c		del_last_visited.c
del_q_static.c		del_q_static.c
dfs.c		dfs.c
error.c		error.c
find_id.c		find_id.c
find_room.c		find_room.c
find_room_by_id.c		find_room_by_id.c
find_ways_and_push_ants.c		find_ways_and_push_ants.c
free.c		free.c
ft_atoi.c		ft_atoi.c
ft_bzero.c		ft_bzero.c
ft_delete_path.c		ft_delete_path.c
ft_isalnum.c		ft_isalnum.c
ft_isdigit.c		ft_isdigit.c
ft_lstadd.c		ft_lstadd.c
ft_lstnew.c		ft_lstnew.c
ft_memmove.c		ft_memmove.c
ft_putchar.c		ft_putchar.c
ft_putnbr.c		ft_putnbr.c
ft_putstr.c		ft_putstr.c
ft_remove_redundant_path.c		ft_remove_redundant_path.c
ft_room_in_path.c		ft_room_in_path.c
ft_room_position.c		ft_room_position.c
ft_strcat.c		ft_strcat.c
ft_strchr.c		ft_strchr.c
ft_strcmp.c		ft_strcmp.c
ft_strcpy.c		ft_strcpy.c
ft_strdup.c		ft_strdup.c
ft_strequ.c		ft_strequ.c
ft_strjoin.c		ft_strjoin.c
ft_strlen.c		ft_strlen.c
ft_strncat.c		ft_strncat.c
ft_strncpy.c		ft_strncpy.c
ft_strnequ.c		ft_strnequ.c
ft_strnew.c		ft_strnew.c
ft_strsplit.c		ft_strsplit.c
get_next_line.c		get_next_line.c
get_room_by_ant_id.c		get_room_by_ant_id.c
is_alnum_str.c		is_alnum_str.c
is_comment.c		is_comment.c
is_digit_str.c		is_digit_str.c
is_end.c		is_end.c
is_link.c		is_link.c
is_room.c		is_room.c
is_start.c		is_start.c
is_visited.c		is_visited.c
last_q_static.c		last_q_static.c
last_v.c		last_v.c
lem_in.h		lem_in.h
main.c		main.c
muravei_idi.c		muravei_idi.c
print_results.c		print_results.c
queue_visit_alloc.c		queue_visit_alloc.c
sort_ways.c		sort_ways.c
struct_int.c		struct_int.c
swap_nodes.c		swap_nodes.c
swap_rooms.c		swap_rooms.c
swap_start_end.c		swap_start_end.c
valid_link.c		valid_link.c
valid_room.c		valid_room.c
visited_arr.c		visited_arr.c