🐜 Find optimal paths for ants

Algorithmes de parcours de graphe et de gestion de flots.

Finds optimal paths to get ants 🐜 across a colony

Digital version of an ant farm.

🐜 This project is meant to make us code an ant farm manager to optimize the movement of a population of ants.

Lem_in

42 2018 - Algorithmic project Lem-In

🐜 Parallel path finder to distribute multiple ants with the least amount of steps using Djikstra

Efficient network algorithm to find the maximum flow within a network, with flow limitations.

An Algo Project at Codam (42) - ant farm

42 algorithms project. Find the optimal flow

Digital version of an ant farm

Handle a virtual anthill efficiently.

A pathfinding algorithm

Graph traversal algorithmic project

{EPITECH} -- First year -- Semester 2 -- sixth CPE project

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.

A route algorithm to optimally cross the anthill

🐜 Basics graph traversal algorithms

The aim of the project to write a program that finds a way out of the labyrinth represented as a text file.