UVA - 193 Graph Coloring
2014-10-29 17:56
344 查看
Graph Coloring |
Inputand Output
The graph is given as a set of nodes denoted by numbers , ,and a set of undirected edges denoted by pairs of node numbers , .The input file contains m graphs. The number m is given on the first line. The first line of each graph contains n and k, the number of nodes and the number of edges, respectively. The followingk lines contain theedges given by a pair of node numbers, which are separated by a space.The output should consists of 2m lines, two lines for each graph found in the input file. The first line of should contain the maximum number of nodes that can be colored black in the graph. The second line should contain one possible optimal coloring.It is given by the list of black nodes, separated by a blank.SampleInput
1 6 8 1 2 1 3 2 4 2 5 3 4 3 6 4 6 5 6
SampleOutput
3 1 4 5
题意:
找出最大的黑色,利用回溯来做;
#include <iostream>#include <cstdio>#include <cstring>#define N 105using namespace std;int T, n, m;int endge;int u,v;int black,ant,ans;int k,Max;int judge(int cur) {for (int i = 1; i <= n; i++) {if (endge[cur][i] && black[i])return 0;}return 1;}void dfs(int cur) {if (cur == n +1) { //记得是n+1k = 0;for (int i = 1; i <= n; i++) {if (black[i]){ant[k++] = i;}}if (Max < k) {for (int i = 0; i < k; i++)ans[i] = ant[i];Max = k;}return ;}//判断与当前cur相连的点是不是黑色,如果return 1 ,表示相连的都是白色;if (judge(cur)) {black[cur] = 1; //相连的点都是白色,标志为黑色dfs(cur+1);black[cur] = 0;}dfs(cur+1); //不能被染色为黑色,只能递归寻找白色}int main () {scanf("%d",&T);while (T--) {scanf("%d%d",&n,&m);memset(endge,0,sizeof(endge));memset(black,0,sizeof(black));for (int i = 0; i < m; i++) {scanf("%d%d",&u,&v);endge[u][v]=1;endge[v][u]=1;}Max = -1;dfs(1);printf("%d\n",Max);int i;for ( i = 0; i < Max -1; i++) // 记得是要小于当前的最大值,也就是Maxprintf("%d ",ans[i]);if (i == Max - 1) printf("%d",ans[i]);printf("\n");}return 0;}
相关文章推荐
- Uva 193 - Graph Coloring
- UVA 193 - Graph Coloring
- uva193 - Graph Coloring
- UVA 193 Graph Coloring
- uva 193 Graph Coloring(图染色 dfs回溯)
- uva 193 Graph Coloring
- UVA 193 Graph Coloring 图染色 DFS 数据
- [回溯]Graph Coloring UVA193
- UVA 193 Graph Coloring 图染色 DFS 数据
- uva 193 Graph Coloring
- UVA 193 Graph Coloring
- UVa 193 - Graph Coloring
- UVa 193 - Graph Coloring
- uva - 193 Graph Coloring(回溯)
- UVa 193 & POJ 1419 - Graph Coloring
- UVA - 193 Graph Coloring
- UVa 193 - Graph Coloring
- uva 193 Graph Coloring(回溯)
- uva 193 - Graph Coloring
- uva193 - Graph Coloring