Lem-in is a project were needed to read a file containing:
- Amount of ants
- Start room
- End room
- Mulitiple other rooms
- Links between rooms
- Coordinates of rooms
- Comments
The goal of this porject is to make an algorithm to find the fastest possible path(s) to sent all ants form start to end. Each room can only have one ant in it at a time. When generating a file with data, there is also specified how many lines the project needs to count to meet the standard
$ make
./ant_farms/lem-in_test.sh