数据结构实验图论一：基于邻接矩阵的广度优先搜索遍历

题目链接

#include<stdio.h>#include<stdlib.h>#include<string.h>int mp[110][110];bool vis[110];int que[10101];int n, m;void BFS(int s){memset(vis,0,sizeof(vis));int ss, ee;int now;ss=ee=0;que[ss++]=s;vis[s]=1;while(ss>ee){now=que[ee++];for(int i=0;i<n;i++){if(vis[i]==0&&mp[now][i]){vis[i]=1;que[ss++]=i;printf(" %d",i);}}}printf("\n");}int main(){int t, s, u, v;scanf("%d",&t);while(t--){scanf("%d%d%d",&n,&m,&s);memset(mp,0,sizeof(mp));for(int i=0;i<m;i++){scanf("%d%d",&u,&v);mp[u][v]=mp[v][u]=1;}printf("%d",s);BFS(s);}return 0;}