main(int argc,char *argv[])
{
FILE *fp;
fp = fopen("D:\\matrix.txt","r");
int m,i,j,k,val;
int valid[MAX_NODE]; /* ,clique[MAX_NODE]; */
int color;

if (argc < 2)
{
printf("Provide data file in command.\n");
perror("error");
exit(1);
}

if ((fp = fopen(argv[1],"r")==NULL)
{
printf("No such graph as %s\n",argv[1]);
exit(1);
}

fscanf(fp,"%d %d",&num_node,&m);
for (i=0;i<num_node;i++)
for (j=0;j<num_node;j++)
{
adj[i][j] = FALSE;
}

for (k=0;k<m;k++) {
fscanf(fp,"%d %d",&i,&j);
adj[i-1][j-1] = TRUE;
adj[j-1][i-1] = TRUE;
}
fclose(fp);

prob_count = 0;
for (i=0;i<num_node;i++)
for (j=0;j<=num_node;j++)
ColorAdj[i][j] = 0;
for (i=0;i<num_node;i++)
for (j=0;j<num_node;j++)
if (adj[i][j]) ColorAdj[i][0]++;
for (i=0;i<num_node;i++)
ColorCount[i]=0;
printf("Graph %s read with %d nodes and %d edges\n",argv[1],num_node,m);
for (i=0;i<num_node;i++)
Handled[i] = FALSE;
BestColoring = num_node+1;
/* ColorClass[0] = 1;
AssignColor(0,1);
Handled[0] = TRUE;*/
valid[i] = TRUE;
for (i=0;i<num_node;i++) valid[i] = TRUE;
num_prob = 0;
max_prob = 10000;

printf("Best coloring has value %d, subproblems: %d\n",val,prob_count);
return 0;
}