C++图的着色问题MCOLORING

余祥宣, 崔国华, 邹海明. 计算机算法基础.3版[M]. 华中科技大学出版社, 2006.
P207 算法8.7
程序的输入是一个名字为input.txt的文件，保存时注意编码格式再VS上运行的话要保存为ANSI编码，如果需要的话我可以上传一份

3 4 4
1 2
2 3
3 4
4 1

#include<iostream>
#include<fstream>
using namespace std;

#define MAX 8

bool GRAPH[MAX][MAX];
int X[MAX];
int m, n;
int COUNT = 0;

bool NEXTVALUE(int k)
{
    int j;
    while (true)
    {
        X[k] = (X[k] + 1) % (m + 1);
        if (X[k] == 0)
            return false;
        for (j = 1; j <= n; j++)
        {
            if (GRAPH[k][j] && (X[k] == X[j]))
                break;
        }
        if (j == n + 1)
            return true;
    }
}

void printX()
{
    int i = 0;
    while (++i <= n)
    {
        cout << X[i] << " ";
    }
    cout << endl;
    COUNT++;
}
void MCOLORING(int k)
{
    while (true)
    {
        NEXTVALUE(k);
        if (X[k] == 0)
            return;
        if (k == n)
            printX();
        else
            MCOLORING(k + 1);
    }

}
int main()
{
    int i, j, k, e;
    ifstream in("input.txt");
    in >> m;
    in >> n;
    in >> e;//n=顶点的个数，e=边的个数
                 //初始化图G
    for (i = 0; i <= n; i++)
    {
        X[i] = 0;
        for (j = 0; j <= n; j++)
        {
            GRAPH[i][j] = 0;
        }
    }
    //构建图G
    for (k = 1; k <= e; k++)
    {
        in >> i >> j ;
        GRAPH[i][j] = 1;
        GRAPH[j][i] = 1;
    }
    MCOLORING(1);
    cout << "Count="<<COUNT<<endl;
    system("pause");
    return 0;
}

运行结果