PAT甲级 1126 Eulerian Path (25分) 测试点问题

 这题没啥难度，理解题意即可，这里需要注意的是需要DFS判断连通图的数量，不是1的直接输出“Non-Eulerian”

#include<iostream>
using namespace std;
int V, E;
int degree[505] = { 0 };
int G[505][505] = { 0 };
bool vis[505] = { false };
void DFS(int now) {
	vis[now] = true;
	for (int i = 1; i <= V; i++) {
		if (!vis[i] && G[now][i] != 0) {
			DFS(i);
		}
	}
}
int main() {
	cin >> V >> E;
	int v1, v2;
	int even_num = 0;
	for (int i = 0; i < E; i++) {
		cin >> v1 >> v2;
		degree[v1]++; degree[v2]++;
		G[v1][v2] = 1;
		G[v2][v1] = 1;
	}
	for (int i = 1; i <= V; i++) {
		cout << degree[i];
		if (i != V)printf(" "); else printf("\n");
		if (degree[i] % 2 == 0)even_num++;
	}
	int cnt = 0;
	for (int i = 1; i <= V; i++) {
		if (!vis[i]) {
			DFS(i);
			cnt++;
		}
	}
	if(cnt!=1)printf("Non-Eulerian");
	else {
		if (even_num == V)printf("Eulerian");
		else if (even_num == V - 2)printf("Semi-Eulerian");
		else printf("Non-Eulerian");
	}
	system("pause");
	return 0;
}