1126 Eulerian Path (25分)

1126 Eulerian Path (25分)

In graph theory, an Eulerian path is a path in a graph which visits every edge exactly once. Similarly, an Eulerian circuit is an Eulerian path which starts and ends on the same vertex. They were first discussed by Leonhard Euler while solving the famous Seven Bridges of Konigsberg problem in 1736. It has been proven that connected graphs with all vertices of even degree have an Eulerian circuit, and such graphs are called Eulerian. If there are exactly two vertices of odd degree, all Eulerian paths start at one of them and end at the other. A graph that has an Eulerian path but not an Eulerian circuit is called semi-Eulerian. (Cited from https://en.wikipedia.org/wiki/Eulerian_path)

Given an undirected graph, you are supposed to tell if it is Eulerian, semi-Eulerian, or non-Eulerian.

Input Specification:

Each input file contains one test case. Each case starts with a line containing 2 numbers N (≤ 500), and M, which are the total number of vertices, and the number of edges, respectively. Then M lines follow, each describes an edge by giving the two ends of the edge (the vertices are numbered from 1 to N).

Output Specification:

For each test case, first print in a line the degrees of the vertices in ascending order of their indices. Then in the next line print your conclusion about the graph – either Eulerian, Semi-Eulerian, or Non-Eulerian. Note that all the numbers in the first line must be separated by exactly 1 space, and there must be no extra space at the beginning or the end of the line.

Sample Input 1:

7 12
5 7
1 2
1 3
2 3
2 4
3 4
5 2
7 6
6 3
4 5
6 4
5 6

Sample Output 1:

2 4 4 4 4 4 2
Eulerian

Sample Input 2:

6 10
1 2
1 3
2 3
2 4
3 4
5 2
6 3
4 5
6 4
5 6

Sample Output 2:

2 4 4 4 3 3
Semi-Eulerian

Sample Input 3:

5 8
1 2
2 5
5 4
4 1
1 3
3 2
3 4
5 3

Sample Output 3:

3 3 4 3 3
Non-Eulerian

题意：

如果一个连通的无向图的所有顶点的度都为偶数，则该图存在欧拉回路，称这样的图为Eulerian；如果一个连通的无向图的所有顶点的度恰好有两个为奇数，则存在从其中一个度为奇数的顶点到另一个度为奇数的顶点的欧拉路径，但是没有欧拉回路，这样的图称之为semi-Eulerian；否则为non-Eulerian；给定一个无向图,判断其为以上三种中的哪一种，先输出每个顶点的度，然后输出图的类型；

分析：

用邻接表存储该图，用一个数组保存所有顶点的度，然后计算顶点度为奇数和偶数的顶点个数，最后进行深度优先搜索判断该图是否连通；

题解：

#include <iostream>
#include <vector>
using namespace std;
vector<int> vec[510];
int degree[510]{ 0 }, visited[510]{0};
void dfs(int j) {
	visited[j] = 1;
	for (int k = 0; k < vec[j].size(); k++) {
		if (!visited[vec[j][k]])
			dfs(vec[j][k]);
	}
}
int main() {
	int n,m,evens=0,odds=0;
	scanf("%d%d", &n,&m);
	for (int i = 0; i < m; i++) {
		int u, v;
		scanf("%d%d", &u, &v);
		vec[u].push_back(v);
		vec[v].push_back(u);
		degree[u]++;
		degree[v]++;
	}
	for (int i = 1; i <= n; i++) {
		if (degree[i] % 2 == 0)
			evens++;
		else
			odds++;
		if (i != 1) printf(" ");
		printf("%d", degree[i]);
	}
	int k = 0;
	for (int i = 1; i <= n; i++) {
		if (!visited[i]) {
			dfs(i);
			k++;
		}
	}
	if (n) printf("\n");
	if (k==1 && evens == n)
		printf("Eulerian\n");
	else if(k==1 && odds == 2)
		printf("Semi-Eulerian\n");
	else
		printf("Non-Eulerian\n");
	return 0;
}