1126. Eulerian Path (25)
来源:互联网 发布:人工智能演讲 编辑:程序博客网 时间:2024/06/01 07:37
- 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
统计每个点的度;
判断是否联通图
#include<iostream>using namespace std;int num[505];int father[505];int n,m;int findfa(int x){ if (father[x]==x) return x; else return father[x]=findfa(father[x]);}int main(){ int t=0,a,b,root=0; cin>>n>>m; for (int i=0;i<=500;i++) father[i]=i; for (int i=0;i<m;i++) { cin>>a>>b; num[a]++; num[b]++; a=findfa(a); b=findfa(b); if(a!=b) father[a]=b; } for (int i=1;i<=n;i++) { cout<<num[i]; if (i!=n) cout<<" "; if (num[i]&1) t++; if (father[i]==i) root++; } cout<<endl; if (root==1) { if (!t) cout<< "Eulerian"; else if (t==2) cout<<"Semi-Eulerian"; else cout<<"Non-Eulerian"; } else cout<<"Non-Eulerian"; return 0;}
- 1126. Eulerian Path (25)
- 1126. Eulerian Path (25)
- 1126. Eulerian Path (25)
- 1126. Eulerian Path (25)
- 1126. Eulerian Path (25)
- 1126. Eulerian Path (25)
- 1126. Eulerian Path (25)
- 1126. Eulerian Path (25)
- PAT 1126. Eulerian Path (25)
- PAT_A 1126. Eulerian Path (25)
- PAT 1126. Eulerian Path (25)
- PAT:1126. Eulerian Path (25)
- PAT (Advanced Level) 1126. Eulerian Path (25)
- PAT 1126. Eulerian Path (25)-甲级
- 1126. Eulerian Path (25) PAT 甲级
- 1126. Eulerian Path (25)[欧拉回路]
- PAT甲级 1126. Eulerian Path (25)
- 【PAT】【Advanced Level】1126. Eulerian Path (25)
- 6.13用数组与if语句来计算数之和
- java项目jsp中如何引用本地路径图片
- 截取图片接口的路径
- 时钟的实时显示
- card效果的实现
- 1126. Eulerian Path (25)
- 对输入数据进行多个异常处理
- ElasticSearch Java Api(三) -更新索引库
- 一、MySQL 安装
- Android双击事件(判断时间范围)
- Magic Powder
- matlab文件导入
- ElasticSearch Java Api(四) -删除索引
- TensorFlow 多分类标签转换成One-hot