Algorithmes de parcours de graphe et de gestion de flots.
-
Updated
Nov 7, 2019 - C
Algorithmes de parcours de graphe et de gestion de flots.
🐜 This project is meant to make us code an ant farm manager to optimize the movement of a population of ants.
42 algorithms project. Find the optimal flow
🐜 Parallel path finder to distribute multiple ants with the least amount of steps using Djikstra
42 2018 - Algorithmic project Lem-In
Efficient network algorithm to find the maximum flow within a network, with flow limitations.
{EPITECH} -- First year -- Semester 2 -- sixth CPE project
A pathfinding algorithm
A route algorithm to optimally cross the anthill
Your ant colony must move from one point to another. But how to make it the shortest path possible? This project introduces you to graphing algorithms: your program will have to intelligently select the precise paths and movements that these ants must take.
The aim of the project to write a program that finds a way out of the labyrinth represented as a text file.
The goal of this project is to find the quickest way to get n-ants across the farm. Project of UNIT Factory (école 42).
Search for the maximum flow on the example of an ant farm
Add a description, image, and links to the lem-in topic page so that developers can more easily learn about it.
To associate your repository with the lem-in topic, visit your repo's landing page and select "manage topics."