广度优先遍历(Breadth-FirstTraversal)


static void bfs(algraph* g, int k)
{
        queue* p = NULL;
        edgenode* node;
        int val;

        initqueue(&p);
        printf("%d ", g->adjlist[k].vertex);
        visited[k] = 1;
        enqueue(&p, k);

        while(!emptyqueue(&p)){
                delqueue(&p, &val);
                node = g->adjlist[val].firstedge;
                while(node != NULL){
                        if(!visited[node->adjvex]){
                                visited[node->adjvex] = 1;
                                printf("%d ", node->adjvex);
                                enqueue(&p, node->adjvex);
                        }
                        node = node->next;
                }
        }
}