列出连通集

06-图1 列出连通集（25 分）

给定一个有N个顶点和E条边的无向图，请用DFS和BFS分别列出其所有的连通集。假设顶点从0到N−1编号。进行搜索时，假设我们总是从编号最小的顶点出发，按编号递增的顺序访问邻接点。

输入格式:

输入第1行给出2个整数N(0<N≤10)和E，分别是图的顶点数和边数。随后E行，每行给出一条边的两个端点。每行中的数字之间用1空格分隔。

输出格式:

按照"{ v​1​​ v​2​​ ... v​k​​ }"的格式，每行输出一个连通集。先输出DFS的结果，再输出BFS的结果。

输入样例:

8 6
0 7
0 1
2 0
4 1
2 4
3 5

输出样例:

{ 0 1 4 2 7 }
{ 3 5 }
{ 6 }
{ 0 1 2 7 4 }
{ 3 5 }
{ 6 }

#include<iostream>
#include<vector>
#include<queue>
using namespace std;
#define maxvertexnum 10 
#define weighttype int
#define datatype string
#define vertex int
struct graph{
int Nv;//定点数 
int Ne;//边数
weighttype G[maxvertexnum][maxvertexnum];
datatype data[maxvertexnum];
};
using Graph=graph*;
vector<int> visited(maxvertexnum,0);
queue<int> q;
struct Enode{
vertex v1,v2;
weighttype weight;
};
using edge=Enode*;
Graph creategraph(int vertexnum){
int w,v; Graph gra=new graph();
gra->Nv=vertexnum;
gra->Ne=0;
for(v=0;v<gra->Nv;v++)
for(w=0;w<gra->Nv;w++)
gra->G[v][w]=0;
return gra;
}
void Insert(Graph gra,edge e){
gra->G[e->v1][e->v2]=1;
gra->G[e->v2][e->v1]=1;
}
Graph buildgraph(){
Graph gra; edge e; vertex v;int Nv,i;
cin>>Nv;
gra=creategraph(Nv);
cin>>gra->Ne;
if(gra->Ne){
e=new Enode();
for(i=0;i<gra->Ne;i++){
cin>>e->v1>>e->v2;
    Insert(gra,e);} 
}
   //for(v=0;v<gra->Nv;v++)
   //cin>>gra->data[v];
   return gra;
}
void DFS(Graph gra,vertex v)
{   vertex v1;
cout<<v<<" "; visited[v]=1;
for(v1=0;v1<gra->Nv;v1++)
if(gra->G[v][v1]==1&&visited[v1]!=1)
DFS(gra,v1);
}
void BFS(Graph gra)
{   vertex v1,v2;
if(q.size()!=0){ 
    v1=q.front();
q.pop();
if(visited[v1]!=1){cout<<v1<<" "; visited[v1]=1;}
for(v2=0;v2<gra->Nv;v2++){
if(visited[v2]!=1&&gra->G[v1][v2]==1)
q.push(v2);}
BFS(gra);}  
}
void DFSLOOK(Graph gra){
vertex v;
for(v=0;v<gra->Nv;v++){
if(visited[v]!=1){
cout<<"{ ";  DFS(gra,v); cout<<"}"<<endl;
}
}
for(auto &o:visited)
o=0;
}
void BFSLOOK(Graph gra){
vertex v;
for(v=0;v<gra->Nv;v++){
if(visited[v]!=1){
cout<<"{ ";  q.push(v); BFS(gra); cout<<"}"<<endl;
}
}
    for(auto &o:visited)
o=0; 
}
int main(){
Graph gra=buildgraph();
//for(int i=0;i<gra->Nv;i++)
//for(int j=0;j<gra->Nv;j++)
//cout<<gra->G[i][j]<<" "<<endl;
DFSLOOK(gra);
BFSLOOK(gra);
return 0;
}