C语言以邻接矩阵为存储结构的图的构造以及广度优先，深度优先遍历

#include <stdio.h>
#include <stdlib.h>
#define MAX_VALUE 10
#define HAVE_PATH 1
#define NO_PATH 0
typedef struct{
    char vexs[MAX_VALUE];//存储顶点元素
    int arc[MAX_VALUE][MAX_VALUE];//存储图结构路径的矩阵
    int vexnum ;//当前定点数
    int arcnum ;//当前边数


}Graph;


//找到该元素所在的下标
int locate(Graph *graph,char ch){
    int i ;
    for(i = 0;i<graph->vexnum;i++){
        if(graph->vexs[i]==ch)
            return i;
    }


    return -1;


}


//构造图元素
Graph* createGraph(){


    Graph *graph;
    char ch;
    graph = (Graph*)malloc(sizeof(Graph));
    graph->arcnum = 0;
    graph->vexnum = 0;
    printf("输入顶点回车退出输入\n");


    while((ch=getchar())!='\n'){


        graph->vexs[graph->vexnum] = ch;
        graph->vexnum++;
        printf("输入顶点回车退出输入\n");
        fflush(stdin);
    }
    int i ,j;
    printf("当前输入的顶点数如下:\n");
    for(i = 0;i<graph->vexnum;i++){


        printf("%c ",graph->vexs[i]);
    }


    printf("输入边数\n");