学习图的广搜~

BFS

邻接矩阵：

void BFS(MGragh g,int v){
	queue <int> qu;
    int visited[MAXV];
    int w,i;
    memset(visited,0,sizeof(visited));
    printf("%3d",v);
    visited[v]=1;
    qu.push(v);
    
    while(!qu.empty()){
        w=qu.front();qu.pop();
        for(i=0;i<g.n;i++)//中出顶点w相邻的顶点
            if(g.edges[w][i]!=0&&g.edges[w][i]!=INF&&visited[i]==0){
                printf("%3d",i);
                visited[i]=1;
                qu.push(i);
            }
    }
}

邻接表：

void BFS(ALGragh g,int v){
    ArcNode *p;
    queue<int> qu;
    int visited[MAXV],w;
    memset(visited,0,sizeof(visited));
    printf("%3d",v);
    visited[v]==1;
    qu.push(v);
    
    while(!qu.empty()){
        w=qu.front();
        qu.pop();
        p=G->adjlist[w].firstarc;
        while(p!=NULL){
            if(visited[p->adjvex]==0){
                printf("3d",p->adjvex);
                visited[p->adjvex]=1;
                qu.push(p->adjvex);
            }
            p=p->nextarc;
        }
    }
}