Breadth-First-Search(伪代码)

//广度优先算法伪代码boolean visited[MAX_VERTEX_NUM]            //设置访问标记数组void BFSTraverse(Graph G){                                          //对图G进行广度优先遍历，设访问函数为visit()for(i = 0;i < G.vexNum; i++)          //访问标记数组初始化visited[i] = FALSE;InitQueue(Q);                         //初始化队列for(i = 0; i < G.vexNum; i++){if(!visited[i])BFS(G,i)}}void BFS(Graph G, int v){                  //从顶点V出发，广度优先遍历，借助一个辅助队列visit(v);visited[v] = TRUE;EnQueue(Q, v);while(!Empty(Q)){Dequeue(Q, v);for(w = FirstNeighbor(G, v); v > 0; w = NextNeighbor(G, v, w)){if(!visited[w]){visit(w);visited[w] = TRUE;EnQueue(Q, w);}}}}