Skip to content

Employing Ant Colony Optimization algorithm to solve maximum clique problem

Notifications You must be signed in to change notification settings

irezwi/aoin-aco-max-clique

Repository files navigation

aoin-aco-max-clique

License: MIT Code style: black Coverage Status

Usage example

python main.py --input input\keller4.mtx --output keller4.csv ref --agents 100

Command line interface

Common arguments:

$ python main.py --help

usage: main.py [-h] [--input INPUT] [--output OUTPUT]
               {aco,ref} ...

positional arguments:
  {aco,ref}

optional arguments:
  -h, --help       show this help message and exit
  --input INPUT
  --output OUTPUT

Reference algorithm:

$ python main.py ref --help

usage: main.py ref [-h] [--agents AGENTS]

optional arguments:
  -h, --help       show this help message and exit
  --agents AGENTS  Agents count

Ant colony optimizer:

$ python main.py aco --help

usage: main.py aco [-h] [--iterations ITERATIONS] [--ants ANTS] [--alpha ALPHA]
                   [--rho RHO]

optional arguments:
  -h, --help            show this help message and exit
  --iterations ITERATIONS
                        Number of algorithm iterations
  --ants ANTS           Ants count
  --alpha ALPHA         Alpha parameter
  --rho RHO             Rho parameter