🐜 Find optimal paths for ants
-
Updated
May 11, 2022 - Go
🐜 Find optimal paths for ants
Algorithmes de parcours de graphe et de gestion de flots.
Finds optimal paths to get ants 🐜 across a colony
🐜 This project is meant to make us code an ant farm manager to optimize the movement of a population of ants.
🐜 Parallel path finder to distribute multiple ants with the least amount of steps using Djikstra
42 2018 - Algorithmic project Lem-In
42 algorithms project. Find the optimal flow
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
lem_in @ 42 - ant simulation and pathfinding
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.
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."