🐜 Parallel path finder to distribute multiple ants with the least amount of steps using Ford-Fulkerson and Max Flow
42 School project
This project is a game about ant farm. Its goal is to find the shortest path from start room to the end.
At the beginning from standart output the program recieves information about number of ants had to be leaded through path, room names (can be numbers, words, characters etc.) with coordinates and links. Here is an example:
Comments "##start" and "##end" are provided to show the start and end room information. We don't care about any other comments.
Simply clone repository and run following commands:
make
./lem-in < maps/subject-1.map
Here 'maps/subject-1.map' is an example of game map.