建立通信网络

xnum; i++)//初始化图Р?{Р for ( j = 1; j <= G->vexnum; j++)Р {Р G->arc[i][j].adj = G->arc[j][i].adj = 0;Р }Р?}Р?Р?for ( i = 1; i <= G->um; i++)//输入边和权值Р?{Р printf("请输入有边的2个顶点\n");Р scanf("%d %d",&n,&m);Р while(n < 0 || n > G->vexnum || m < 0 || n > G->vexnum)Р {Р printf("输入的数字不符合要求请重新输入:\n");Р scanf("%d%d",&n,&m);Р }Р Р G->arc[n][m].adj = G->arc[m][n].adj = 1;Р getchar();Р printf("请输入%d与%d之间的权值:\n", n, m);Р scanf("%d",&G->arc[n][m].weight);Р?}Р Р?printf("邻接矩阵为:\n");Р?for ( i = 1; i <= G->vexnum; i++)Р?{ Р for ( j = 1; j <= G->vexnum; j++)Р {Р printf("%d ",G->arc[i][j].adj);Р }Р printf("\n");Р?}Р}Рvoid sort(edge edges[],MGraph *G)//对权值进行排序Р{Р?int i, j;Р?Р?for ( i = 1; i < G->um; i++)Р?{Р for ( j = i + 1; j <= G->um; j++)Р {Р if (edges[i].weight > edges[j].weight)Р {Р Swapn(edges, i, j);Р }Р }Р?}