//容易
void CreateMGraph(MGraph * G)
{
int i,j,k,w;
printf(“输入顶点数和边数:\n”);
scanf(“%d,%d”,&G->numVertexes,&G->numEdges); //输入顶点数和边数
for(i=0;i<G->numVertexes;i++)
scanf(&G->vexs[i]);
for (i=0;i<G->numVertexes;I++)
for(j=0;j<G->numVertexes;j++)
G->arc[i][j]=INFINITY; //邻接矩阵初始化
for(k=0;k<G->numEdges;K++) //读入numEdges条边,建立邻接矩阵
{
printf(“输入边(vi,vj)上的下标i,下标j和权w:\n”);
scanf(“%d,%d,%d”,&i,&,j,&w); //输入边(vi,vj)上的权w
G->arc[i][j]=w;
G->arc[j][i]=G->arc[i][j];
}
}
04-05
4461
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
07-06
1万+
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)