深度优先搜索也是基本内容之一
参考代码:
#include<iostream>
using namespace std;
const int N = 1000;
int n,g[N][N];
bool visited[N]={0};
void dfs(int x){
cout<<x<<" ";
visited[x]=true;
for (int i=1;i<=n;i++)
if (g[x][i]&&!visited[i])
dfs(i);
}
int main(){
memset(g,0,sizeof(g));
int e;
cin>>n>>e;
for (int i=0,x,y;i<e;i++){
cin>>x>>y;
g[x][y]=g[y][x]=1;
}
for (int i=1;i<=n;i++)
if (!visited[i]) dfs(i);
return 0;
}
//5 8
//1 3
//2 3
//1 4
//3 4