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.

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

An Algo Project at Codam (42) - ant farm

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

42 2018 - Algorithmic project Lem-In

42 algorithms project. Find the optimal flow

Handle a virtual anthill efficiently.

A pathfinding algorithm

Graph traversal algorithmic project

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

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.

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.

Search for the maximum flow on the example of an ant farm

C language | BFS Graph Algorithm | [name]Hex

Elementary algorithmic project.

The goal of this project is to find the quickest way to get n-ants across the farm. Project of UNIT Factory (école 42).

Help the ants to find the fastest way to finish!