GitHub - LiaOlya/Lem-in: You must move your ant colony from one point to another in the least amount of time. Through this project, you will explore graph traversal algorithms: your program will have to choose the paths and moves to be taken by the ants.

LiaOlya / Lem-in Public

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

You must move your ant colony from one point to another in the least amount of time. Through this project, you will explore graph traversal algorithms: your program will have to choose the paths and moves to be taken by the ants.

0 stars 0 forks Branches Tags Activity

Star

Notifications

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 2 Commits
libft		libft
.gitignore		.gitignore
Makefile		Makefile
author		author
del.c		del.c
extra.c		extra.c
extra2.c		extra2.c
ft_nodes.c		ft_nodes.c
get_info.c		get_info.c
get_output.c		get_output.c
get_room.c		get_room.c
get_routes.c		get_routes.c
lemin.h		lemin.h
main.c		main.c
move_ants.c		move_ants.c
routes.c		routes.c
search.c		search.c