数据结构__广度优先遍历（BFS）用STL的vector与queue实现

给出代码：

#include<iostream>
#include<vector>
#include<queue>
#define maxn 1000
bool inq[maxn] = { false };
using namespace std;

struct node
{
	int adjvex;
	char data;
	int weight;
	int layer;
};

vector<node> adj[maxn];
int n;

void createNode(char a,int i,int w=0)
{
	node temp;
	temp.adjvex = a-'a';
	temp.data = a;
	temp.weight = w;
	adj[i].push_back(temp);
}

void create()
{
	int m;
	cin >> n >> m;
	for (int i = 0; i < n; i++)
	{
		char tempA;
		cin >> tempA;
		createNode(tempA, i);
	}
	char a, b;
	int cost,aa,bb;
	for (int i = 0; i < m; i++)
	{
		cin >> a >> b >> cost;
		for (int j = 0; j < n; j++)
		{
			if (a == adj[j][0].data)
				aa = adj[j][0].adjvex;
		}
		createNode(b, aa, cost);
	}
}

void print()
{
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < adj[i].size(); j++)
		{
			cout << adj[i][j].data <<adj[i][j].weight << ' ';
		}
		cout << endl;
	}
}

queue<node>q;
void BFS(int s)
{
	node start;
	start.adjvex  = s;
	start.layer = 0;
	q.push(start);
	inq[start.adjvex] = true;
	while (!q.empty())
	{
		node topNode = q.front();
		q.pop();
		int u = topNode.adjvex;
		for (int i = 0; i < adj[u].size(); i++)
		{
			node next = adj[u][i];
			next.layer = topNode.layer + 1;
			if (inq[next.adjvex] == false)
			{
				cout << next.data;
				q.push(next);
				inq[next.adjvex] = true;
			}
		}
	}
}

void BFSTrave()
{
	for (int u = 0; u < n; u++)
	{
		if (inq[u] == false)
		{
			cout << adj[u][0].data;
			BFS(adj[u][0].adjvex);
		}
	}
}

int main(void)
{
	create();
	print();
	BFSTrave();
	system("pause");
	return 0;
}

两组I/O：

第二组：