Skip to content

Latest commit

History

56 Commits

Folders and files

NameName
Last commit message
Last commit date

Repository files navigation

██╗ ███████╗███╗ ███╗ ██╗███╗ ██╗
██║ ██╔════╝████╗ ████║ ██║████╗ ██║
██║ █████╗ ██╔████╔██║█████╗██║██╔██╗ ██║
██║ ██╔══╝ ██║╚██╔╝██║╚════╝██║██║╚██╗██║
███████╗███████╗██║ ╚═╝ ██║ ██║██║ ╚████║
╚══════╝╚══════╝╚═╝ ╚═╝ ╚═╝╚═╝ ╚═══╝
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.
Final grade = 125/100

lemin

About

🐝 Basics graph traversal algorithms. Algorithm Dijkstra and A* search algorithm

Topics

Resources

Stars

1 star

Watchers

0 watching

Forks

Releases

Packages

Contributors

Languages