Lem_in
Lem_in is a School 21 (Ecole 42) project.
The purpose of the project is to find the shortests paths in a graph to move ants from start room to end room with the least number of steps.Ants will also need to avoid traffic jams as well as walking all over their fellow ants. All solutions involve rigorous input validation and algorithmic optimization.
Compiling
Run the following commands:
To compile:
make
To remove objects:
make clean
To remove objects and binary file (program):
make fclean
To re-compile:
make re
Running
To run the program:
./lemin < path/map.txt