#include<stdio.h>
#include<stdlib.h>
#include<string.h>
int *vertexs;
int **graph;
int vertex_number;
int edge_number;
int m;
//初始化图和结点
void init() {
printf("请输入颜色的数量");
scanf("%d", &m);
printf("请输入结点的数量");
scanf("%d", &vertex_number);
printf("请输入边的数量");
scanf("%d", &edge_number);
vertexs = (int*)malloc(sizeof(int) * vertex_number);
graph = (int**)malloc(sizeof(int*) * vertex_number);
for (int i = 0; i < vertex_number; ++i) {
graph[i] = (int*)malloc(sizeof(int) * vertex_number);
for (int j = 0; j < vertex_number; ++j) {
graph[i][j] = 0;
}
}
for (int i = 0; i < edge_number; ++i) {
int x, y;
printf("请输入第%d条边第一个结点的序号", i);
scanf("%d", &x);
printf("请输入第%d条边第二个结点的序号", i);
scanf("%d", &y);
graph[x][y] = 1;
graph[y][x] = 1;
}
}
//判断是否响铃结点颜色相同进行剪枝
bool ok(int x) {
for (int i = 0; i < x; ++i) {
if (graph[i][x] && vertexs[i] == vertexs[x]) {
return false;
}
}
return true;
}
//回溯
void dfs(int x) {
if (x == vertex_number) {
for (int i = 0; i < vertex_number; ++i) {
printf("%d ", vertexs[i]);
}
printf("\n");
return;
}
for (int i = 1; i <= m; ++i) {
vertexs[x] = i;
if (ok(x)) {
dfs(x + 1);
}
}
}
int main() {
init();
dfs(0);
return 0;
}
图的m着色问题C语言源代码回溯
最新推荐文章于 2023-05-07 17:30:46 发布