PAT甲级——A1126 Eulerian Path【30】

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 ( $\leq 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:

Sample Output 1:

2 4 4 4 4 4 2
Eulerian

Sample Input 2:

Sample Output 2:

2 4 4 4 3 3
Semi-Eulerian

Sample Input 3:

Sample Output 3:

3 3 4 3 3
Non-Eulerian

题⽬⼤意：如果⼀个连通图的所有结点的度都是偶数，那么它就是Eulerian，如果除了两个结点的度是

奇数其他都是偶数，那么它就是Semi-Eulerian，否则就是Non-Eulerian～

分析：⽤邻接表存储图，判断每个结点的度【也就是每个结点i的v[i].size()】是多少即可得到最终结果

～注意：图必须是连通图，所以要⽤⼀个深搜判断⼀下连通性，从结点1开始深搜，如果最后发现统计

的连通结点个数cnt != n说明是不是连通图，要输出Non-Eulerian～

 1 #include <iostream>
 2 using namespace std;
 3 int path[505] = { 0 }, graph[505][505];
 4 int n, m, a, b, odd = 0, num = 0;
 5 bool visit[505] = { false };
 6 void DFS(int s)
 7 {
 8     visit[s] = true;
 9     num++;
10     for (int i = 1; i <= n; ++i)
11         if (graph[s][i] == 1 && visit[i] == false)            
12             DFS(i);
13 }
14 int main()
15 {    
16     cin >> n >> m;    
17     while (m--)
18     {
19         cin >> a >> b;
20         path[a]++;
21         path[b]++;
22         graph[a][b] = graph[b][a] = 1;
23     }
24     for (int i = 1; i <= n; ++i)
25     {
26         if (path[i] % 2 == 1)
27             odd++;
28         cout << (i == 1 ? "" : " ") << path[i];
29     }
30     DFS(1);//判断是不是连通图
31     if (num == n && odd == 0)
32         cout << endl << "Eulerian" << endl;
33     else if (num == n && odd == 2)
34         cout << endl << "Semi-Eulerian" << endl;
35     else
36         cout << endl << "Non-Eulerian" << endl;
37     return 0;
38 }