SDUT 3364 数据结构实验之图论八：欧拉回路

#include <bits/stdc++.h>
using namespace std;

bool Graph[1010][1010];
bool vis[1010];
int du[1010];//顶点度数
int sum, n, k, m;//sum：统计是否每个顶点仅走一次
void DFS(int s);

int main()
{
cin >> k;
while(k --)
{
sum = 0;
int flag = 1;
memset(vis, 0, sizeof(vis));
memset(Graph, 0, sizeof(Graph));
memset(du, 0, sizeof(du));
cin >> n >> m;
for(int i = 1; i <= m; i++)
{
int u, v;
cin >> u >> v;
Graph[u][v] = Graph[v][u] = 1;
du[u]++;
du[v]++;
}
vis[1] = 1;
sum++;
DFS(1);
for(int i = 1; i <= n; i++)
{
if(du[i] % 2  == 1)
{
flag = 0;
break;
}
}
if(flag == 1 && sum == n)
{
cout << 1 << endl;
}
else
{
cout << 0 << endl;
}

}
return 0;
}

void DFS(int s)
{
for(int i = 1; i <= n; i++)
{
if(!vis[i] && Graph[s][i])
{
vis[i] = 1;
sum++;
DFS(i);
}
}
}