图的创建和遍历

#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#define MAXSIZE 5
//图的结构
typedef struct Graph{
    char *vexs;
    int** arcs;
    int vexnum;
    int arcnum;
}graph;
//队列的结构
typedef struct QUEUE{
    int data[MAXSIZE];
    int front;
    int rear;
}queue;

queue* initqueue(){
    queue* Q=(queue*)malloc(sizeof(queue));
    Q->front=Q->rear=0;
    return Q;
}

int isfull(queue* Q){
    if((Q->rear+1)%MAXSIZE==Q->front){
        return 1;
    }else{
        return 0;
    }
}

void enqueue(queue*Q,int data){
    if(isfull(Q)){
        return;
    }
    Q->data[Q->rear]=data;
    Q->rear=(Q->rear+1)%MAXSIZE;
}

int isempty(queue*Q){
    if(Q->rear==Q->front){
        return 1;
    }else{
        return 0;
    }
}

int dequeue(queue*Q){
    if(isempty(Q)){
        return -1;
    }
    int data=Q->data[Q->front];
    Q->front=(Q->front+1)%MAXSIZE;
    return data;
}

graph* init(int vexnum){
    //开辟空间
    graph* G=(graph*)malloc(sizeof(graph));
    G->vexs=(char*)malloc(sizeof(char)*vexnum);
    G->arcs=(int**)malloc(sizeof(int*)*vexnum);
    for(int i=0;i<vexnum;i++){
        G->arcs[i]=(int*)malloc(sizeof(int)*vexnum);
    }
    G->vexnum=vexnum;
    G->arcnum=0;
    return G;
}

void create(graph* G,char* vex,int *arcs){
    //赋值
    for(int i=0;i<G->vexnum;i++){
        G->vexs[i]=vex[i];
        for(int j=0;j<G->vexnum;j++){
            G->arcs[i][j]=*(arcs+i*G->vexnum+j);
            if(G->arcs[i][j]==1){
                G->arcnum++;
            }
        }
    }
    G->arcnum/=2;
}

void dfs(graph*G,int *visited,int index){
    //深度优先搜索
    printf("%c ",G->vexs[index]);
    visited[index]=1;
    for(int i=0;i<G->vexnum;i++){
        if(G->arcs[index][i]==1&&!visited[i]){
            dfs(G,visited,i);
        }
    }
}

void bfs(graph*G,int *visited,int index){
    //宽度优先搜索
    queue*Q=initqueue();
    enqueue(Q,index);
    visited[index]=1;
    while(!isempty(Q)){
        int t=dequeue(Q);
        printf("%c ",G->vexs[t]);
        for(int i=0;i<G->vexnum;i++){
            if(G->arcs[t][i]==1&&!visited[i]){
                enqueue(Q,i);
                visited[i]=1;
            }
        }
    }
}

int main(){
    //对图进行初始化
    graph*G=init(5);
    //创建一个查看有无访问的数组
    int *visited=(int*)malloc(sizeof(int)*G->vexnum);
    //访问数组初始化
    for(int i=0;i<G->vexnum;i++){
        visited[i]=0;
    }
    //边的连接数组
    int arcs[5][5] = {
        0,1,1,1,0,
        1,0,1,1,1,
        1,1,0,0,0,
        1,1,0,0,1,
        0,1,0,1,0
    };
    //创建图
    create(G,"ABCDE",(int*)arcs);
    dfs(G,visited,0);
    printf("\n");
    for(int i=0;i<G->vexnum;i++){
        visited[i]=0;
    }
    bfs(G,visited,0);
    return 0;
}