连通图
Time Limit:1000MS Memory Limit:65536K
Total Submit:141 Accepted:84
Description
判断一个图是否为一个边通图
Input
n 顶点 (n<=100)
边
Output
1 表示连通
0 表示不边通
Sample Input
5
1 2
2 3
5 4
0 0
Sample Output
0
var
v:array[1..100]of boolean;a:array[0..100,0..100]of boolean;
i,n,max,ans,x,y:longint;
procedure dfs(i:longint);
var j:longint;
begin
for j:=1 to n do
if (a[i,j])and(v[j]) then
begin
v[j]:=false;
inc(ans);
dfs(j);
end;
end;
begin
read(n);
fillchar(a,sizeof(a),false);
fillchar(v,sizeof(v),true);
read(x,y);
while (x<>0)or(y<>0) do
begin
a[x,y]:=true;
a[y,x]:=true;
readln(x,y);
end;
dfs(1);
for i:=1 to n do
if v[i] then
begin
write(0);
halt;
end;
write(1);
end.