Made for UnitFactory's Lem_in project. A project with my implementation of the shortest path search algorithm. (BFS)
Your ant colony must move from on point to another. How do you do it in the shortest time possible? This project will get you acquainted with graph traversal algorithms: your program will have to intelligently select paths and precise movements used by the ants.
Use the link below to install lem_in.
https://github.com/msaliuta/Lem_in.gitto be done
