邻接矩阵实现无向图的创建

#include<stdio.h>#define Maxsize 50#define M 5000//定义无穷数值为5000typedef struct{char vex[Maxsize];//顶点表int arc[Maxsize][Maxsize];//矩阵表int numVertexes,numEdges;//顶点数和边数}MGraph;void GreateGraph(MGraph *G){int i,j,k;printf("请输入顶点数和边数:");scanf("%d %d",&G->numVertexes,&G->numEdges);printf("请输入顶点的值:");for(i=0;G->numVertexes;i++)scanf("%c",&G->vex[i]);for(j=0;j<G->numVertexes;j++)for(k=0;k<G->numVertexes;k++){G->arc[i][j]=M;}//初始化矩阵for(i=0;i<G->numEdges;i++)//对每个边赋予权值{printf("输入边（Vi，Vj）的下标i,j和权值:");scanf("%d %d %d",&i,&j,&k);G->arc[i][j]=k;G->arc[j][i]=G->arc[i][j];}}