PAT甲级1126 Eulerian Path (25分)|C++实现

一、题目描述

原题链接

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 Path，其余的我们都视为Non-Eulerian。那么我们用dfs来判断一个图是否所有结点都连通，遍历所有结点，看每个结点的度是否为偶数，最后按照要求输出即可。

三、AC代码

#include<iostream>
#include<cstdio>
#include<v