PAT-1126 Eulerian Path

最新推荐文章于 2022-03-21 23:19:04 发布

原创最新推荐文章于 2022-03-21 23:19:04 发布 · 140 阅读

0 ·

CC 4.0 BY-SA版权

浙大PAT-Advanced 专栏收录该内容

119 篇文章

订阅专栏

本文介绍了一种用于判定无向图是否为欧拉图、半欧拉图或非欧拉图的算法。通过深度优先搜索（DFS）来验证图的连通性，并统计每个顶点的度数，以此为基础进行判定。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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:

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

判断是否是欧拉图/半欧拉图，dfs判断连通性，统计各端点的度。

#include<stdio.h>
#include<set>
#include<algorithm>
using namespace std;

bool g[505][505];
int degree[505];
bool visited[505]={0};
int n,m;
void dfs(int v){
	visited[v]=true;
	for(int i=1;i<=n;i++){
		if(!visited[i]&&g[v][i]==true)
			dfs(i);
	}
}
int main(){

	scanf("%d %d",&n,&m);
	fill(g[0],g[504]+505,false);
	fill(degree,degree+n,0);

	for(int i=0;i<m;i++){
		int a,b;
		scanf("%d%d",&a,&b);
		g[a][b]=true;
		g[b][a]=true;
		degree[a]++;
		degree[b]++;
	}

	dfs(1);
	bool connected=true;
	for(int i=1;i<=n;i++){
		if(!visited[i]){
			connected=false;	
			break;
		}
	}
	int odd=0;
	for(int i=1;i<=n;i++){
		if(degree[i]%2==1)
			odd++;
		if(i!=1)printf(" ");
		printf("%d",degree[i]);
	}
	printf("\n");
	if(connected&&odd==0)
		printf("Eulerian");
	else if(connected&&odd==2)
		printf("Semi-Eulerian");
	else
		printf("Non-Eulerian");

	return 0;
}