is a 42 school project. in this project 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.
MohammedEsafi/Lem_in
Paths finder to move ants from start room to end room with the least amount of steps ― maximum flow at minimum cost
C