Algorithmic project meant to find the quickest way to get n ants 🐜 across the farm (from start to end-room).
Project allows to dive into graph theory,
as well as develop effective algorithm to transfer ants throughout the farm's labyrinth.
Click here to see the subject.
Project is written in MVC pattern. The ways are built using BFS algoritm.
Allocation of given ants between valid ways is done using self-developed algorithm.
- make
- ./lem-in [-a] [-e] < maps/[some_map.txt]
- make fclean
