//对连通图从顶点v开始用visit()先广访问
void AdjMWGraph::BroadFirstSearch(const int v, int visited[],void visit(VerT item))
{
VerT u,w;
SeqQueue queue; //定义队列queue
visit(GetValue(v));
visited[v]=1;
queue.QInsert(v);
while(!queue.QueueEmpty())
{
u=queue.QDelete();
w=GetFirstNeighbor(u);
while(w!=-1)
{
if(!visited[w])
{
visit(GetValue(w));
visited[w]=1;
queue.QInsert(w);
}
w=GetNextNeighbor(u,w);
}
}
}
g.BroadFirstSearch(0,visited,Printchar);
芜湖不芜
精慕HU
相关分类