问题及代码:
/*深度优先搜索算法遍历图的各个顶点*/
#include<stdio.h>
int n,sum,book[101];
int e[101][101];
void dfs(int cur)
{
int i;
printf("%d",cur);
sum++;
if(sum==n) return;
for(i=1;i<=n;i++)
{
if(e[cur][i]==1 && book[i]==0)
{
book[i]==1;
dfs(i);
}
}
return;
}
int main()
{
int i,j,m,a,b;
scanf("%d %d",&n,&m);
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
if(i==j) e[i][j]=0;
else e[i][j]=99999;
}
for(i=1;i<=m;i++)
{
scanf("%d %d",&a,&b);
e[a][b]=1;
e[b][a]=1;
}
book[1]=1;
dfs(1);
getchar();getchar();
return 0;
}
/*广度优先搜索算法遍历图的各个顶点*/
#include<stdio.h>
int main()
{
int i,j,n,m,a,b,cur,e[101][101],book[101]={0};
int que[10001],head,tail;
scanf("%d %d",&n,&m);
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(i==j) e[i][j]=0;
else e[i][j]=9999999;
for(i=1;i<=m;i++)
{
scanf("%d %d",&a,&b);
e[a][b]=1;
e[b][a]=1;
}
head=1;
tail=1;
que[tail]=1;
tail++;
book[1]==1;
while(head<tail)
{
cur=que[head];
for(i=1;i<=n;i++)
{
if(e[cur][i]==1 && book[i]==0)
{
que[tail]=i;
tail++;
book[i]==1;
}
if(tail>n)
break;
}
head++;
}
for(i=1;i<tail;i++)
printf("%d",que[i]);
getchar();getchar();
return 0;
}
两个搜索结果都出错,为何?