利用图所学知识,实现图的广度优先遍历。
存储形式使用邻接表。
(有向图:0,有向网:1,无向图:2,无向网:3)
为了方便,我们利用二维数组来表示一个邻接表。
下面上代码,注意看BFS的过程
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int vis[100]; //标记数组
vector<char> edge[100]; //二维数组来表示邻接表
void bfs(int cur) //广搜,cur表示当前到达的结点
{
queue<char> q;
q.push(edge[cur][0]);
vis[cur] = 1;
while (!q.empty())
{
cur = q.front() - 'a';
cout << edge[cur][0] << ' ';
for (int i = 1; i < edge[cur].size(); i++)
{
int x = edge[cur][i] - 'a';
if (!vis[x])
{
q.push(edge[cur][i]);
vis[x] = 1;
}
}
q.pop();
}
}
int main()
{
int vexnum, arcnum; //顶点数,边数
int x,y,w,p,choice = 0,start = 0; //choice为选择的图结构(有向图:0,有向网:1,无向图:2,无向网:3),start为遍历起点
char a, b, ch;
cin >> choice >> vexnum >> arcnum;
for (int i = 1; i <= vexnum; i++) //输入顶点表
{
cin >> ch;
p = ch - 'a';
if (i == 1)
start = p;
edge[p].push_back(ch);
}
if (choice < 2)
{
if (choice % 2 == 1) //有向网
{
for (int i = 1; i <= arcnum; i++)
{
cin >> a >> b >> w;
x = a - 'a';
if (edge[x].size() == 1)
edge[x].push_back(b);
else
edge[x].insert(edge[x].begin() + 1, b);
}
}
else
{
for (int i = 1; i <= arcnum; i++) //有向图
{
cin >> a >> b;
x = a - 'a';
if (edge[x].size() == 1)
edge[x].push_back(b);
else
edge[x].insert(edge[x].begin() + 1, b);
}
}
}
else
{
if (choice % 2 == 1) //无向网
{
for (int i = 1; i <= arcnum; i++)
{
cin >> a >> b >> w;
x = a - 'a';
y = b - 'a';
if (edge[x].size() == 1)
edge[x].push_back(b);
else
edge[x].insert(edge[x].begin() + 1, b);
if (edge[y].size() == 1)
edge[y].push_back(b);
else
edge[y].insert(edge[y].begin() + 1, a);
}
}
else
{
for (int i = 1; i <= arcnum; i++) //无向图
{
cin >> a >> b;
x = a - 'a';
y = b - 'a';
if (edge[x].size() == 1)
edge[x].push_back(b);
else
edge[x].insert(edge[x].begin() + 1, b);
if (edge[y].size() == 1)
edge[y].push_back(b);
else
edge[y].insert(edge[y].begin() + 1, a);
}
}
}
bfs(start); //从起点开始BFS
for (int i = 0; i < vexnum; i++)
{
if (!vis[i])
bfs(i);
}
return 0;
}
输入
输出结果