PAT A1126 . 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

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <string.h>
#include <string>
#include <queue>
#include <set>
#include <map>
using namespace std;

const int maxn = 510;
int Degree[maxn] = {0};//入度
vector<int> G[maxn];//邻接表
bool vis[maxn] = {false};
int n, m;//n个顶点,m条边
void DFS(int u){
vis[u] = true;
for(int i = 0; i < G[u].size();i++){
int v = G[u][i];
if(vis[v] == false){
DFS(v);
}
}
}
int main(){
int u, v;
/*freopen("in.txt", "r", stdin);*/
scanf("%d%d", &n, &m);
for(int i = 0; i < m; i++){
scanf("%d%d", &u, &v);
Degree[u]++;
Degree[v]++;
G[u].push_back(v);
G[v].push_back(u);
}
int count = 0;//记录连通数
for(int u = 1; u <= n; u++){
if(vis[u]==false){
DFS(u);
count++;
}
}
int odd = 0, even = 0;
for(int i = 1;i <= n; i++){
if(Degree[i] % 2 == 0) even++;
else odd++;
printf("%d", Degree[i]);
if(i < n)printf(" ");
else printf("\n");
}
if(count != 1){
printf("Non-Eulerian\n");
}else if(odd == 2){
printf("Semi-Eulerian\n");
}else if(even == n){
printf("Eulerian\n");
}else{
printf("Non-Eulerian\n");
}
return 0;

}