建立图地邻接矩阵或邻接表存储并在此基础上实现图地深度优先遍历和广度优先遍历 #include "stdafx.h" #include "conio.h" #include "stdio.h" #include "stdlib.h" typedef enum {FALSE, TRUE} BOOLEAN; #define OVERFLOW -1 #define OK 1 #define ERROR 0...
7、eateMGraph*/ void CreateALGraph(ALGraph *G) /*建立无向图的邻接表存储*/int i,j,k;char vi;EdgeNode *s; printf("请输入顶点数和边数:n");scanf("%d,%d",&(G->n),&(G->e); printf("请输入顶点信息Vin例如a,每输入一个顶点后回车:n"); for (i=0;i<G->n;i+) scanf("%s",&...