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

 1 #include <iostream>
 2 #include <cstdio>
 3 
 4 using namespace std;
 5 
 6 #define MVN 1010
 7 
 8 typedef struct AdjMatrix
 9 {
10     int w;
11     char *info;
12 }AM;
13 
14 typedef struct MGraph
15 {
16     int vex[MVN];
17     AM arc[MVN][MVN];
18     int vexnum,arcnum;
19 }MG;
20 
21 void creat(MG &G)
22 {
23     int i,j,k;
24     for(k=1;k<=G.vexnum;k++)
25         G.vex[k]=k;
26     for(k=1;k<=G.arcnum;k++)
27     {
28         scanf("%d %d",&i,&j);
29         G.arc[i][0].w++;
30         G.arc[j][0].w++;
31         G.arc[i][j].w=1;
32         G.arc[j][i].w=1;
33     }
34 }
35 
36 int count;
37 void DFS(MG G,bool *visited,int i)
38 {
39     visited[i]=true;
40     count++;
41     int k;
42     for(k=1;k<=G.vexnum;k++)
43     {
44         if(G.arc[i][k].w>0&&visited[k]==false)
45             DFS(G,visited,k);
46     }
47 }
48 
49 int main()
50 {
51     int t;
52     scanf("%d",&t);
53     while(t--)
54     {
55         MG G={0};
56         scanf("%d %d",&G.vexnum,&G.arcnum);
57         creat(G);
58         int k,f=0;
59         for(k=1;k<=G.vexnum;k++)
60         {
61             if(G.arc[k][0].w%2!=0)
62             {
63                 f=1;
64                 break;
65             }
66         }
67         if(f)
68         {
69             printf("0\n");
70             continue;
71         }
72         count=0;
73         bool visited[MVN]={false};
74         DFS(G,visited,1);
75         if(count!=G.vexnum)
76         {
77             printf("0\n");
78             continue;
79         }
80         printf("1\n");
81     }
82     return 0;
83 }
84 
85 /***************************************************
86 User name: ***
87 Result: Accepted
88 Take time: 56ms
89 Take Memory: 11588KB
90 Submit time: 2016-11-09 21:56:24
91 ****************************************************/