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
Ω
判断图为欧拉图(所有节点的度为偶数)、半欧拉图(除了两个节点度为奇数,其余点度均为偶数) or 非欧拉图。题目都把判断方式写出来了,剩下的就考察英语阅读理解了。
当然这一切成立还存在一个前提条件,也是测试点3暗藏的大坑——这个图必须是连通图。这个点其实不难想到,因为计算机中将0也视为偶数,那么如果一条边也没有,所有点度都为偶数,按照上述理论应为欧拉图(礼貌的微笑.jpg)。所以判断前别忘了来个【DFS/BFS/并查集】检查一下连通性。
🐎
#include <iostream>
#include <vector>
using namespace std;
vector<vector<int>> edge;
vector<bool> flag;
int dfs(int n)
{
flag[n] = true;
int sum = 0;
for (auto &k: edge[n])
{
if (flag[k]) continue;
sum += dfs(k);
}
return sum + 1;
}
int main()
{
int n, m, a, b;
cin >> n >> m;
edge.resize(n + 1), flag.resize(n + 1, false);
for (int i = 0; i < m; ++i)
{
cin >> a >> b;
edge[a].push_back(b), edge[b].push_back(a);
}
int odd = edge[1].size() % 2, even = 1 - edge[1].size() % 2;
cout << edge[1].size();
for (int i = 2; i <= n; ++i)
{
cout << " " << edge[i].size();
edge[i].size() % 2 ? ++odd : ++even;
}
cout << endl;
if (dfs(1) < n) printf("Non-Eulerian");
else printf(even == n ? "Eulerian" : (odd == 2 ? "Semi-Eulerian" : "Non-Eulerian"));
}