🐜 Find optimal paths for ants

JavaScript package for easy integration with the API of 2captcha captcha solving service to bypass recaptcha, hcaptcha, funcaptcha, geetest and solve any other captchas.

'School 42' good algorithmic project. Optimized graph and minimum-cost flow (disjoint path finding).

An Algo Project at Codam (42) - ant farm

{EPITECH} | First year | Elementary programming in C project

An "Hex" simulator, that prints the quickest way to get N ants across the farm. To be the first to arrive, ants will need to take the shortest path. They will also need to avoid traffic jams as well as walking all over their fellow ants.

find the shortest path between two nodes in a graph

Epitech Project, lemin

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

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

🐜🗺️ 21 Project Algo branch // This project calculates the smallest path and time for an ant colony to travel from point A to point B.

Good algorithmic project. Optimized graph and minimum-cost flow.

🐜 Basics graph traversal algorithms

This project implements a pathfinding algorithm in order to move ants from one point of a graph to another.

Moving an ant colony from one point to another, choosing the shortest path of the graph and optimising by the number of moves that are needed.

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