Lem-in is an algorithmic 42 project focused on pathfinding algorithms.
The goal is moving n ants from the start node to the end node in a graph.
For more details, look at the subject
git clone --recursive https://github.com/fedefloris/Lem_in.git && cd Lem_in && make
./lem-in < maps/subject.map
This project is licensed under the MIT License - see the LICENSE.md file for details