图的着色算法

using System;
namespace graphColoring
{
    class Program
    {
        static void Main(string[] args)
        {
            Console.WriteLine("请输入顶点数：");
            string numberN = Console.ReadLine();
            int N = Int32.Parse(numberN);

            Console.WriteLine("请输入颜色数：");
            string numberColor = Console.ReadLine();
            int M= Int32.Parse(numberColor);

            int[, ] matN = new int[N, N];           //无向图的邻接矩阵
            Console.WriteLine("请输入无向图的邻接矩阵：");
            for(int i = 0; i < N; i++)
            {
                string str = Console.ReadLine();
                string[] temp = str.Split(" ".ToCharArray());
                for(int j = 0; j < N; j++)
                {
                    matN[i, j] = Int32.Parse(temp[j]);
                }
            }
            int[,] MatN = matN;
            graph myGraph = new graph(N,M,MatN);
            Console.WriteLine("所有的方案：");
            myGraph.graphDeal();

        }
    }
    class graph
    {
        private int n;                           //顶点数
        private int m;                           //颜色数
        private int[,] matN;                     //邻接矩阵
        private int[] color;                     //着色方案
        public graph(int N,int M,int[,] MatN)
        {
            n = N;
            m = M;
            matN = MatN;
            color = new int[n];
            for (int i = 0; i < n; i++)
                color[i] = 0;
        }
        public void graphDeal()
        {
            ColorGraph(matN, m, color, 0);
        }
        private bool IsSafe(int[, ] matN,int[] color, int n1, int i)
        {
            for(int j = 0; j < n; j++)
                if (matN[n1, j] == 1 && i == color[j])
                    return false;
            return true;
        }
        private void ColorGraph(int[, ] matN,int m,int[] color,int n1)
        {
            if (n == n1)
            {
                printSolution(color);
                return;
            }
            for(int i = 1; i <= m; i++)
            {
                if (IsSafe(matN, color, n1, i))
                {
                    color[n1] = i;
                    ColorGraph(matN, m, color, n1 + 1);
                    color[n1] = 0;                           //如果缺少则color无法在每个正确或者错误的方案完成后重置
                }
            }
        }
        void printSolution(int[] color)
        {
            foreach(int i in color)
            {
                Console.Write(i+" ");
            }
            Console.WriteLine();
        }
    }
}