🐜 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.
A pathfinding problem using DFS algorithm to find optimal paths for moving ants through tunnel networks from start to end while managing traffic jams and minimizing total moves. Built with Go, this project demonstrates graph algorithms, complex data structure manipulation, input parsing with error handling, and algorithmic problem-solving
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.
A pathfinding algorithm
A route algorithm to optimally cross the anthill
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."