ZOJ 3321 Circle

题意:给出一个图的N个点,Ｍ条边,判断这个图是否是一个环,图里没有自环,重边.

思路:给出的Ｎ和Ｍ都很小,首先题目里已经给出定义,如果N<3那么肯定不是环.如果 边的数目大于顶点数Ｎ那么肯定有多余的边,可以否定掉.

都满足的条件下,用类似欧拉回路的方法删边去dfs就可以了.

#include <cstdio>
#include <memory.h>
using namespace std;
const int MAX = 21;

int n, m;
int end;
bool g[MAX][MAX];
bool dfs(int i, int f, int left){
	if(left == 0 && i == end)return true;
	for(int j = 1; j <= n; ++j){
		if(g[i][j] == true && j != f){
			g[i][j] = g[j][i] = false;
			if(dfs(j, i, left - 1))return true;
			g[i][j] = g[j][i] = true;
		}
	}
	return false;
}
int main(int argc, char const *argv[]){
	
	while(scanf("%d%d", &n, &m) == 2){
		memset(g, false, sizeof(g));
		for(int i = 1; i <= m; ++i){
			int x, y;
			scanf("%d%d", &x, &y);
			g[x][y] = g[y][x] = true;
		}
		end = 1;
		if( n < 3 || m != n || !dfs(1, -1, n)){
			printf("NO\n");
		}else{
			printf("YES\n");
		}
	}
	return 0;
}