18. 图的广度优先遍历

本实验实现邻接表表示下无向图的广度优先遍历。

程序的输入是图的顶点序列和边序列(顶点序列以*为结束标志，边序列以-1,-1为结束标志)。程序的输出为图的邻接表和广度优先遍历序列。例如：

程序输入为：
a 
b 
c 
d 
e 
f 
*
0,1 
0,4 
1,4 
1,5 
2,3 
2,5 
3,5
-1,-1

程序的输出为： 
the ALGraph is 
a 4 1 
b 5 4 0 
c 5 3 
d 5 2 
e 1 0 
f 3 2 1
the Breadth-First-Seacrh list:aebfdc

#include "stdio.h"
#include "stdlib.h"
#include "string.h"

typedef struct list{
    char ch;
    int number, visited;
    struct list *next;
} List;
int queue[1000];
int first = 0, last = 0;
List *head[100];

int CreateList(List *head[100], int count){
    char ch;
    List *p;
    while(1){
        scanf("%c",&ch);
        getchar();
        if(ch == '*') break;
        else{
            p = (List*)malloc(sizeof(List));
            p->number = count;
            p->next = NULL;
            p->visited = 0;
            p->ch = ch;
            head[count++] = p;
        }
    }

    while(1){
        int x, y;
        scanf("%d,%d",&x,&y);
        if(x == -1 && y == -1) break;
        else{
            p = (List*)malloc(sizeof(List));
            p->number = y;
            p->ch = head[p->number]->ch;
            p->visited = 0;
            if(head[x]->next == NULL) p->next = NULL;
            else p->next = head[x]->next;
            head[x]->next = p;

            p = (List*)malloc(sizeof(List));
            p->number = x;
            p->ch = head[p->number]->ch;
            p->visited = 0;
            if(head[y]->next == NULL) p->next = NULL;
            else p->next = head[y]->next;
            head[y]->next = p;
        }
    }
    
    return count;
}

void Print(List *head[100], int count){
    printf("the ALGraph is\n");
    List *p;
    for(int i = 0; i < count; i++){
        printf("%c",head[i]->ch);
        p = head[i]->next;
        while(p != NULL){
            printf(" %d",p->number);
            p = p->next;
        }
        printf("\n");
    }
}

void BFS(){
    List *p = head[queue[first]]->next;
    while(p!=NULL){
        if(head[p->number]->visited == 0){
            queue[last] = p->number;
            head[p->number]->visited = 1;
            last++; 
        }
        p = p->next;
    }
    first++;
}

int main()
{
    
    int count = 0;
    count = CreateList(head, count);
    Print(head, count);
    printf("the Breadth-First-Seacrh list:");
    // queue[0] = 0;
    // head[0]->visited = 1;
    // last++;
    // while(first != last){
    //     BFS();
    // }
    for(int count1 = 0; count1 < count; count1++){
        if(head[count1]->visited == 0){
            for(int i = 0; i < 1000; i++){
                queue[i] = -1;
            }    
            first = 0;
            last = 0;
            queue[0] = count1;
            head[count1]->visited = 1;
            last++;
            while(first != last){
                BFS();
            }

            int i = 0;
            printf("%c",head[queue[i++]]->ch);
            while(queue[i] != -1){
                printf("%c",head[queue[i++]]->ch);
            }
        }
    }
    printf("\n");
    return 0;
}