传送门:欧拉回路
欧拉回路模板题。检查所给图是否连通,可以通过并查集或 dfs 进行判断。
并查集:
#include <bits/stdc++.h>
#define ll long long
#define INF 0x3f3f3f3f
using namespace std;
const int maxn = 1e3+3;
int n, m;
int deg[maxn];
int pre[maxn];
void init()
{
for(int i = 0; i < maxn; ++i)
{
deg[i] = 0;
pre[i] = i;
}
}
int Find(int x)
{
int r = x;
while(pre[r] != r) //寻根
r = pre[r];
int i = x, j;
while(i != r) //路径压缩,由多级分层压缩至单级
{
j = pre[i];
pre[i] = r;
i = j;
}
return r;
}
void Union(int x, int y)
{
int rx = Find(x), ry = Find(y);
if(rx != ry)
pre[rx] = pre[ry];
}
void read()
{
cin >> m;
int u, v;
for(int i = 0; i < m; ++i