Files
-----

Makefile: make an executable (main) and test on the CSP instance defined in the file pb-100-8-14-25-10
aco.c csp.c phero.c random.c stat.c: source files
pb-100-8-14-25-10: example of CSP instance
README: this file

Usage
-----

AntSolver may be used with the following arguments:
-a (alpha: int) 
-b (beta: int) 
-r (rho: float) 
-c (max number of cycles: int) 
-n (number of ants: int) 
-m (tau min: float) 
-M (tau max: float) 
-i (input CSP filename) 
-s (seed: positive int) 
-p (pheromone strategy: {c=clique, v=vertex}

File format
-----------

The format of the file that describes the CSP to solve is:

First line: numberOfVar SizeOfDomains
Next lines: one line by constraint. Each line first gives the two variables involved in the constraint, and then lists the nogoods (i.e. pairs of values that violate the constraint). The line is ended by "-1".
The last line contains "-1"