GitHub - nestoroprysk/Lem-in: Lem-in is a basic path-finding algorithm. The aim of the project is to compute the most efficient scenario for a group of independent subjects of how to get to the destination. There are two main parts: finding unique roads (based on BFS using an adjacency list) and prioritizing which roads to take for every given subject.

nestoroprysk / Lem-in Public

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

Lem-in is a basic path-finding algorithm. The aim of the project is to compute the most efficient scenario for a group of independent subjects of how to get to the destination. There are two main parts: finding unique roads (based on BFS using an adjacency list) and prioritizing which roads to take for every given subject.

0 stars 0 forks Branches Tags Activity

Star

Notifications

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 4 Commits
includes		includes
libft		libft
Makefile		Makefile
author		author
bonus.c		bonus.c
convert_lines_to_graph1.c		convert_lines_to_graph1.c
convert_lines_to_graph2.c		convert_lines_to_graph2.c
convert_lines_to_graph3.c		convert_lines_to_graph3.c
create_list_of_roads1.c		create_list_of_roads1.c
create_list_of_roads2.c		create_list_of_roads2.c
create_list_of_roads3.c		create_list_of_roads3.c
create_list_of_roads4.c		create_list_of_roads4.c
free.c		free.c
get_and_check_lines1.c		get_and_check_lines1.c
get_and_check_lines2.c		get_and_check_lines2.c
get_and_check_lines3.c		get_and_check_lines3.c
get_and_check_lines4.c		get_and_check_lines4.c
get_and_check_lines5.c		get_and_check_lines5.c
main.c		main.c
run_ants_run1.c		run_ants_run1.c
run_ants_run2.c		run_ants_run2.c
run_ants_run3.c		run_ants_run3.c
search_breadth_first1.c		search_breadth_first1.c
search_breadth_first2.c		search_breadth_first2.c