This repository contains an implementation of the Ant Colony Optimization algorithm.
Given a matrix that represents a graph, the algorithm returns a list of paths, ordered by the shortest distance covered.
$ python main.py
| Name | Name | Last commit date | ||
|---|---|---|---|---|