The goal is to bring an ant colony through the shortest path(yeah, first of all, we need to find it) across the farm. Where the farm is just an undirected graph represented in terms of rooms(vertices) and links(edges). For a more complete description, you'd prefer to look into the subject.
git clone https://github.com/vsokh/lem-in.git && \
cd lem-in && \
git submodule update --init --recursive && \
make
The program receives the data describing the ant farm from the standard output in the following format:
number_of_ants
the_rooms
the_links
Example of input:
At the beginning of the game all colony is in the room ##start. And the goal is to bring them to the room ##end.
3
##start
0 1 0
##end
1 5 0
2 9 0
3 13 0
0-2
2-3
3-1
And the program produces output in the following format:
Lx-y Lz-w Lr-o
Where x, z, r represents the ants’ numbers (going from 1 to number_of_ants) and y, w, o represents the rooms’ names.
L1-2
L1-3 L2-2
L1-1 L2-3 L3-2
L2-1 L3-3
L3-1
C code has written following Norminette(42 code style specifications for almost all C-based projects) rules.
vsokolog