C++ 地图涂色问题 栈&递归

C++ 地图涂色问题 栈&递归

问题描述：

编写程序，用四种颜色对中国地图染色，输出任意一种染色方案。
用递归和非递归两种算法来实现。

C++ 代码 来啰：

说明：
1. 自己实现顺序栈来实现非递归操作。
2. 具有两个测试地图，区域数量不同，需要加以修改。

/*
***************************************************************************************************
* 
* Author		:		YU.J.P
* Time			;		2022/04/09
* Project		:		Experment Two -- Map coloring.
*
* Explanation	:		It just takes my 8 hours of that day. 
* 
***************************************************************************************************
*/

//地图四涂色问题

#include "bits/stdc++.h"
using namespace std;

//#define ALLCITY		7			//城市数目
#define ALLCITY		34			//城市数目
#define colorNum	4			//色彩数目
#define elemtype	int			//元素类型
#define MAXSIZE		1024		//栈容量

typedef struct {
	elemtype city[MAXSIZE];		//城市
	int top;					//指针
}sqStack;						//定义栈

/* 初始化顺序栈 */
void InitStack(sqStack* s) {
	//将顺序栈s置空
	s->top = 0;
}

/* 元素进栈 */
void stackPush(sqStack* s,elemtype e) {
	//判断栈是否为满
	if (s->top == MAXSIZE)
		printf("Overflow");
	else {
		s->city[s->top++] = e;
	}
}

/* 元素出栈 */
elemtype stackPop(sqStack* s) {
	//如果栈为空，返回空元素NULL
	if (s->top == 0)
		return NULL;
	else {
		s->top--;				//栈顶指针减1	
		return s->city[s->top];	//返回原栈顶元素值
	}
}

/* 打印栈中元素 */
void stackPrint(sqStack* s) {
	for (int i = s->top - 1; i >= 0; i--)
		printf("[%d],", s->city[i]);
	printf("\n");
}

/* 地图染色数组 */
int color[ALLCITY] = { 0 };			//初始化无色

/* 测试地图 */
int testMap[7][7] = {
	{0,1,1,1,1,1,0},
	{1,0,0,0,0,1,0},
	{1,0,0,1,1,0,0},
	{1,0,1,0,1,1,0},
	{1,0,1,1,0,1,0},
	{1,1,0,1,1,0,0},
	{0,0,0,0,0,0,0},
};

/* 感谢五班大佬连夜码出来的地图 */
int China[34][34];
void init_ChinaMap() {
	//北京0		天津1	上海2	重庆3
	//河北4		山西5	辽宁6	吉林7	黑龙江8	江苏9	浙江10  安徽11  福建12  江西13  山东14  
	//河南15	湖北16  湖南17	广东18	海南19	四川20  贵州21  云南22  陕西23  甘肃24  青海25  台湾26
	//内蒙古27  广西28  西藏29	宁夏30	新疆31
	//香港32	澳门33
	for (int i = 0; i < 34; i++) {	//初始化
		memset(China[i],0,34*sizeof(int));
	}
	China[0][1]   = China[0][4]   = 1;
	China[1][0]   = China[1][4]   = 1;
	China[2][9]   = China[2][10]  = 1;
	China[3][16]  = China[3][17]  = China[3][20]  = China[3][21]  = China[3][23]  = 1;
	China[4][0]   = China[4][1]   = China[4][5]   = China[4][6]   = China[4][14]  = China[4][15]  = China[4][27]  = 1;
	China[5][4]   = China[5][15]  = China[5][23]  = China[5][27]  = 1;
	China[6][4]   = China[6][7]   = China[6][27]  = 1;
	China[7][6]   = China[7][8]   = China[7][28]  = 1;
	China[8][7]   = China[8][27]  = 1;
	China[9][2]   = China[9][10]  = China[9][11]  = China[9][14]  = 1;
	China[10][2]  = China[10][9]  = China[10][11] = China[10][12] = China[10][13] = 1;
	China[11][9]  = China[11][10] = China[11][13] = China[11][14] = China[11][15] = China[11][16] = 1;
	China[12][10] = China[12][13] = China[12][18] = China[12][26] = 1;
	China[13][10] = China[13][11] = China[13][12] = China[13][16] = China[13][17] = China[13][18] = 1;
	China[14][4]  = China[14][9]  = China[14][11] = China[14][15] = 1;
	China[15][4]  = China[15][5]  = China[15][11] = China[15][14] = China[15][16] = China[15][23] = 1;
	China[16][3]  = China[16][11] = China[16][13] = China[16][15] = China[16][17] = China[16][23] = 1;
	China[17][3]  = China[17][13] = China[17][16] = China[17][18] = China[17][21] = China[17][28] = 1;
	China[18][12] = China[18][13] = China[18][17] = China[18][19] = China[18][28] = 1;
	China[19][18] = 1;
	China[20][3]  = China[20][21] = China[20][22] = China[20][23] = China[20][24] = China[20][25] = China[20][29] = 1;
	China[21][3]  = China[21][17] = China[21][20] = China[21][22] = China[21][28] = 1;
	China[22][20] = China[22][21] = China[22][28] = China[22][29] = 1;
	China[23][3]  = China[23][5]  = China[23][15] = China[23][16] = China[23][20] = China[23][24] = China[23][27] = China[23][30] = 1;
	China[24][20] = China[24][23] = China[24][25] = China[24][27] = China[24][30] = China[24][31] = 1;
	China[25][20] = China[25][24] = China[25][29] = China[25][31] = 1;
	China[26][12] = 1;
	China[27][4]  = China[27][5]  = China[27][6]  = China[27][7]  = China[27][8]  = China[27][23] = China[27][24] = China[27][30] = 1;
	China[28][17] = China[28][18] = China[28][21] = China[28][22] = 1;
	China[29][20] = China[29][22] = China[29][25] = China[29][31] = 1;
	China[30][23] = China[30][24] = China[30][27] = 1;
	China[31][24] = China[31][25] = China[31][29] = 1;
	China[32][18] = 1;
	China[33][18] = 1;
}

/* 循环判断是否同色 */
bool isEqualColor(int* arr,int* color,int city) {
	for (int i = 0; i < city; i++) 			//相邻 且颜色相同
		if (arr[i] == 1 && color[city] == color[i])
			return true;					//具有相同色返回1
	return false;							//颜色不相同返回0
}

/* 非递归 栈实现 */
void colorMapWithStack(int map[][ALLCITY]){
	sqStack* S;
	S = (sqStack*)malloc(sizeof(sqStack));
	InitStack(S);			//置空

	int city = 0;			//标记区域
	stackPush(S,city);		//第一个城市初始入栈
	color[city++] = 1;		//涂色为1 区域加1

	while (city < ALLCITY) {			//涂色循环条件
		if (color[city] ==  0)			//初始化为1
			color[city] = 1;

		while (1) {
			if (color[city] > colorNum) {	//没有可用涂色 回溯
				color[city] = 0;			//非常非常关键 清零
				city = stackPop(S);			//弹出栈顶
				color[city]++;				//颜色++
				break;						//退出循环
			}
											//相邻如果有颜色相同
			if (isEqualColor(map[city], color, city)){							
				color[city]++;				//颜色++
			}else {
				stackPush(S, city);			//入栈
				city++;						//下一个地区
				break;						//退出循环
			}
		}
	}
}

/* 循环判断是否同色 */
bool colorIsSame(int city, int* map) { 
	for (int i = 0; i < city; i++)				//相邻 且颜色相同
		if (map[i] == 1 && color[i] == color[city])
			return true;						//具有相同色返回1							
	return false;								//颜色不相同返回0
}

/* 递归实现 */
/* city为着色的起点，算法从0开始 */
void colorMapRecursive(int city,int map[][ALLCITY]) {	
	if (city > ALLCITY - 1)							//递归出口
		throw true;									//抛出异常退出递归
	else
		for (int i = 1; i <= colorNum; i++) {		//对每种色彩逐个测试
			color[city] = i;						//试色
			if (colorIsSame(city, map[city]) == 0)	//不重合
				colorMapRecursive(city + 1, map);	//进行下一块着色
		}
}

/* MAIN */
int main() {
	cout << "\t地图四涂色问题" << endl;

	init_ChinaMap();							//初始化中国地图
	
	/* 栈实现 */
//	colorMapWithStack(testMap);					//非递归算法
	colorMapWithStack(China);					//非递归算法
	cout << "1.栈实现[非递归]：\n" << endl;
	cout << "颜色编号：";
	for (int i = 0; i < ALLCITY; i++) {
		cout << "[" << color[i] << "],";
	}
	cout << "\n" << endl;

	/* 递归实现 */
	cout << "2.递归实现：\n" << endl;
	memset(color,0,ALLCITY*sizeof(int));		//清零
	try {										//捕获异常来退出递归
//		colorMapRecursive(0, testMap);			//递归算法
		colorMapRecursive(0, China);			//递归算法
	}catch (bool get) {							//是否正常退出
		cout << (get ? "递归退出:OK" : "递归退出:NO") << endl;	
	}
	cout << "颜色编号：";
	for (int i = 0; i < ALLCITY; i++){
		cout << "[" << color[i] << "],";
	}
	cout << "\n" << endl;

	cout << "Over..." << endl;
	return 0;
}

不长不短,看起来真是好极了…

这位少侠，不妨点个赞鼓励一下作者…