6-1-1 图-基本概念与表示 哥尼斯堡的“七桥问题” (25 分)

刚开始用dfs做，发现最大N出现段错误，算了下时间复杂度会达到几百亿哈哈哈

思路：无向图存在欧拉回路的充分必要条件：连通图和各顶点度都是偶数；判断连通就用并查集，看fa[n]<0的个数是否为1；其他的就easy；

​
#include<stdio.h>
int graph[10005][10005];
int dfs(int n);
int m, v, e;//v为顶点数，e为边数
int search();
int fa[1005];
void join(int x, int y);
int find(int x);
int main()
{
    for (int i = 1; i < 1005; i++) fa[i] = -1;
    int v, e;
    scanf("%d %d", &v, &e);
    for (int i = 0; i < e; i++) {
        int x1, x2;
        scanf("%d %d", &x1, &x2);
        join(x1, x2);
        graph[x1][x2] = graph[x2][x1] = 1;
    }
    int cnt = 0, flag = 0;
    for (int i = 1; i <= v; i++) {
        if (fa[i] < 0) cnt++;
    }
    for (int i = 1; i <= v; i++) {
        int m = 0;
        for (int j = 1; j <= v; j++) {
            if (graph[i][j] > 0) m++;
        }
        if (m % 2 == 1) {
            flag = 1; break;
        }
    }
    if (flag == 0 && cnt == 1) printf("1");
    else printf("0");


    return 0;
}
int find(int x) {
    if (fa[x] < 0) return x;
    else return fa[x] = find(fa[x]);
}
   void join(int x, int y) {
       int x1 = find(x), x2 = find(y);
       if (x1 != x2) {
          fa[x1] = x2;
       }
  }

​