已知中国地图,对各省进行着色,要求相邻省所使用的颜色不同,并保证使用的颜色总数最少。地图采用数据结构中无向图的存储结构存储，中国的三十四个省为三十四个节点，若两省相邻则存在一条边。任选一个节点作为初始节点开始着色，与其不相邻的边涂为相同颜色，然后再未涂色的节点中任选一节点重复上述步骤，直到所有节点均涂上色为止。-Known map of China, the provinces colored neighboring Province, the colors used, and to ensure that at least the total number of colors used. Map using the data structure to the storage structure of the storage, the thirty-four provinces in China for 30 four nodes, then there exists an edge if the adjacent provinces. Choose one node as the initial node to start coloring, its not adjacent edges are painted the same color, and then choose one node in the node then Unpainted Repeat the above steps until all the nodes are painted in colors so far.