🐜 Find optimal paths for ants
Algorithmes de parcours de graphe et de gestion de flots.
Finds optimal paths to get ants 🐜 across a colony
42 algorithms project. Find the optimal flow
🐜 This project is meant to make us code an ant farm manager to optimize the movement of a population of ants.
Efficient network algorithm to find the maximum flow within a network, with flow limitations.
42 2018 - Algorithmic project Lem-In
🐜 Parallel path finder to distribute multiple ants with the least amount of steps using Djikstra
Epitech 1st year project : Lem_in
A pathfinding algorithm
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
Go implementation of the classic ant farm pathfinding project
{EPITECH} -- First year -- Semester 2 -- sixth CPE project
To associate your repository with the lem-in topic, visit your repo's landing page and select "manage topics."