#include<iostream>
#include<cstdio>
#include<queue>
#include<cstring>
#define max_sum 30
using namespace std;
typedef struct Arcnode{
int adjvex;
struct Arcnode *nextarc;
}Arcnode;
typedef struct Vexnode{
char data;
struct Arcnode *firstarc;
}Vnode,AdjList[max_sum];
typedef struct Graph{
AdjList vexlist;
int vex_sum;
int arc_sum;
int arc_matrix[max_sum][max_sum];
}Graph;
int visit[max_sum];
void creat_graph(Graph &g){
cout<<"输入顶点和边的个数:"<<endl;
cin>>g.vex_sum>>g.arc_sum;
for(int i = 1;i <= g.vex_sum;i++)
{
cout<<"输入字符:"<<endl;
cin>>g.vexlist[i].data;
g.vexlist[i].firstarc = NULL;
}
for(int i = 1;i <= g.arc_sum;i++)
{
cout<<"输入起点和终点:"<<endl;
int s,e;
cin>>s>>e;
Arcnode *p = new Arcnode;
p->adjvex = e;
p->nextarc = g.vexlist[s].firstarc;
g.vexlist[s].firstarc = p;
}
}
void matrix_make(Graph &g){ //由邻接表构造邻接矩阵
Arcnode *p = new Arcnode;
memset(g.arc_matrix,0,sizeof(g.arc_matrix));
for(int i = 1;i <= g.vex_sum;i++)
{
p = g.vexlist[i].firstarc;
while(p){
g.arc_matrix[i][p->adjvex] = 1;
p = p->nextarc;
}
}
for(int i = 1;i <= g.vex_sum;i++)
for(int j = 1;j <= g.vex_sum;j++)
if(g.arc_matrix[i][j] == 1)g.arc_matrix[j][i] = 1;
}
void BFSTravel(Graph &g) //广度优先遍历
{
queue<int> Q;
for(int i = 1;i <= g.vex_sum;i++)visit[i] = 0;
for(int i = 1;i <= g.vex_sum;i++)
{
if( !visit[i]){ //每个遍历分支的头节点(若只有一个遍历分支则只进行一次)
visit[i] = 1;
printf("%c\n" , g.vexlist[i].data);
Q.push(i);
while(!Q.empty()){
int k = Q.front();//取头节点
Q.pop();
for(int j = 1;j <= g.vex_sum;j++)
if(g.arc_matrix[k][j] == 1 && visit[j] == 0)
{
visit[j] = 1;
printf("%c\n" , g.vexlist[j].data);
Q.push(j);
}
}
}
}
}
int main()
{
Graph g,r;
creat_graph(g);
matrix_make(g);
BFSTravel(g);
}