搜索—>深搜广搜拓补排序

#include<stdio.h>
#include<string.h>
#define N 5
int e[5][5]=
{0,1,0,1,0,
1,0,1,0,1,
0,1,0,1,1,
1,0,1,0,0,
0,1,1,0,0
};
int book[5],n = N;

void dfs(int x)
{
printf("%d ",x);
for(int i=0; i<n; i++)
{
if(book[i]==0 && e[x][i]==1)
{
book[i]=1;
             dfs(i);
}

}
}
int main()
{
memset(book,0,sizeof(book));
book[0]=1;
printf("深搜遍历结果 :\n\n");
dfs(0);
printf("\n");
return 0;
}
#include<stdio.h>
#include<string.h>
#define N 5
int e[5][5]=
{0,1,0,1,0,
1,0,1,0,1,
0,1,0,1,1,
1,0,1,0,0,
0,1,1,0,0
};

int q[100],book[100];
int n =N;
void bfs()
{
int tail=0,head=0;
book[0]=1;
q[tail++]=0;
while(head < tail)
{
int x=q[head];
printf("%d ",x);
for(int i=0; i<n;i++)
{
if(book[i]==0 &&e[x][i])
{
book[i]=1;
q[tail++]=i;
}
}
head++;
}
}
int main()
{
memset(book,0,sizeof(book));
printf("广搜遍历结果：\n");
bfs();
printf("\n");
return 0;

}


#include<stdio.h>
#include<string.h>
int num,a[100],n=4,d[100];
int e[4][4]=
{0,1,1,0,
0,0,0,0,
0,0,0,1,
0,0,0,0
};
void toposort()
{
for(int i=0; i<n; i++)
{
int x;
for(int j=0; j<n; j++)
{
if(d[j]==0)
{
x=j;
break;
}
}
d[x]=-1;
a[num++]=x;
for(int k=0; k<n; k++)
{
if(e[x][k]==1)
d[k]--;
}
}
}
int main()
{
num=0;
memset(a,0,sizeof(a));
memset(d,0,sizeof(d));
for(int i=0; i<n; i++)
{
for(int j=0; j<n; j++)
{
if(e[i][j])
d[j]++;
}
}
toposort();
printf("输出拓扑排序结果：\n");
for(int j=0; j<num; j++)
printf("%d ",a[j]);
printf("\n");
return 0;
}