原题链接: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
题目大意: 给出一个图,让你输出各个结点的度数,并判断他是欧拉图、半欧拉图、非欧拉图。
分析:
- 连通图的所有顶点的度数都为偶数:欧拉图
- 连通图有两个度数为奇数的结点,其他都是偶数:半欧拉图
- 其他的:非欧拉图
注意: 要先通过dfs判断给出的图是否是连通图,未判断的话第三个测试点会过不去。
代码:
#include <bits/stdc++.h>
using namespace std;
const int maxn = 510;
int n, m; //无向图的点 边
vector<vector<int> > v; //邻接表存储图
vector<bool> vis;
int cnt = 0, even = 0; //cnt dfs中访问的结点 even度数为偶数的结点数
void dfs(int index) {
vis[index] = true;
cnt++;
for (int i = 0; i < v[index].size(); i++)
if (vis[v[index][i]] == false)
dfs(v[index][i]);
}
int main(){
scanf("%d%d", &n, &m);
v.resize(n+1);
vis.resize(n+1);
for(int i = 0; i < m; i ++ ){
int a, b;
scanf("%d%d", &a, &b);
v[a].push_back(b);
v[b].push_back(a);
}
for(int i = 1; i <= n; i ++ ){
if(v[i].size()%2 == 0) even++;
if(i != 1) printf(" ");
printf("%d", v[i].size());
}
printf("\n");
dfs(1);
if (even == n && cnt == n)
printf("Eulerian");
else if(even == n - 2 && cnt == n)
printf("Semi-Eulerian");
else
printf("Non-Eulerian");
return 0;
}
心得:涉及图的结点度数这种,用邻接表存储图会比较好:
vector<vector<int> > v; //邻接表存储图