Working solution for the School 21’s educational algorithmic project lem-in.
It utilizes modified Edmonds-Karp algorithm in order to find a set of quickest routes for a given number of ants through a given “ant farm”.
Team: sliasndr, fcatina. Special thanks to krvkir.
Clone repo, then run make to compile, lem-in binary will be generated.
To run program just pass some “map” to it, for example one from the included maps folder:
./lem-in < maps/ant_farm.txt
42’s map generator is also included as lemin-gen, run it separatly to examine options:
lemin-gen --help
You can pass auto-generated map to the program like this:
lemin-gen --big | ./lem-in
Use check_all.sh script to test program for all the cases provided by the generator. To view its options run
./check_all.sh -h
Also check local wiki (in russsian!) for additional information.
Alternatively use attached docker image - pull it and launch without arguments to run basic set of tests.