广度优先搜索

 1 void BreadthFirstSearch(Vertex *graph, int VertexNum)
 2 {
 3     queue<int> vertexQueue;
 4 
 5     cout << "广度遍历:" << endl;
 6     vertexQueue.push(0); // 先将某个顶点放入队列
 7     graph[0].color = GRAY;
 8     while (!vertexQueue.empty())
 9     {
10         int uIdx = graph[vertexQueue.front()].idx;
11         vertexQueue.pop();
12         cout << uIdx << endl; // 访问pop出的顶点
13         Vertex *pre = &graph[uIdx];
14         while (pre->next)
15         {
16             int vIdx = pre->next->idx;
17             if (graph[vIdx].color == WHITE)
18             {
19                 vertexQueue.push(vIdx); // 将未访问过的邻接节点添加至队列
20                 graph[vIdx].color = GRAY;
21             }
22             pre = pre->next;
23         }
24         graph[uIdx].color = BLACK;
25     }
26 }