#include "color.h"

int main (int argc, char* argv[]) {
  long *parameter = new long[4];

/*		parameter[0] -	max number of pseudo-randomly generated 
		maximal independent sets (MISs) per 
		color selection.
		in the search for the first MIS, the
		program generates parameter[0]*parameter[3]
		pseudo-random MISes.
		for each consecutive color class the 
		program lowers the number of generated
		MISes according to the curve defined at
		line 188 in color.cpp.
		parameter[1] -  min number of pseudo-randomly generated 
				maximal independent sets (MISs) per 
				color selection.
		parameter[2] -	number of pseudo-randomly generated
				MISes generated during local search for the best
				color class.
		parameter[3] -	cardinality of the pool of solutions
				maintained during the search process.
This program contains some of the ideas presented in 
the 1997 DAC paper on graph coloring.
*/

  parameter[0] = 1000; /* number_of_basic iterations */
  parameter[1] = 10; /* number_of_basic+_iterations */
  parameter[2] = 50; /* number_of_local_iterations */
  parameter[3] = 5; /* window size */
  long colors = 0;
  Graph testgraph (argv[1]);
  testgraph.GraphColoring(parameter, colors);
  delete parameter;
  return (0);
}