2)建立邻接矩阵 算法71,72.pl62~163 void CreateMGraph(MGraph &G) i int i,j, k, W; char vl, v2 printf("Input vexnum arcum scanf( % od, %d,, &G. vexnum, &G arcum) printf("Input Vertices: scanf(%os"Gvex) /for(i=0; K<G.vexnum; i++) scanf(%/oc,&G.vexsiD for(1=0; K<G. vexnum; 1++) for =0 K<G. vexnum:j ++ G arcsin=02）建立邻接矩阵 算法7.1,7.2,p162~163 void CreateMGraph(MGraph &G) { int i,j,k,w; char v1,v2; printf("Input vexnum & arcnum:"); scanf(“%d,%d”,&G.vexnum,&G.arcnum); printf("Input Vertices:"); scanf("%s",G.vexs); // for (i=0;i<G.vexnum;i++) // scanf("%c",&G.vexs[i]); for (i=0;i<G.vexnum;i++) for (j=0;j<G.vexnum;j++) G.arcs[i][j]=0;