//图的遍历--广度优先搜索 
void BreadFirstSearch(Graph g int v0){visit(v0);visited[v0] = True;InitQueue(&Q);EnterQueue(&Q, v0);while(!IsEmpty(Q)){DeleteQueue(&Q, &v);w = FirstAdjVertex(g, v);while(w != -1){if(!visited[w]){visit(w);visited[w] = True;EnterQueue(&Q, w);}w = NextAdjVertex(g, v, w);}}
}