void creatUndirected_Graph(MyGraph &mygraph) {
cout << "请依次输入图的总顶点数,边数" << endl;
cin >>
网页链接 >> mygraph.curArcNum;
cout << "请依次输入顶点的信息" << endl;
for(int i = 0; i < mygraph.curVexNum; i++) {
cin >> mygraph.vexs[i];
}
//初始化邻接矩阵
for (int i = 0; i < mygraph.curVexNum; i++) {
for (int j = 0; j < mygraph.curVexNum; j++) {
mygraph.arcs[i][j] = MaxInt;
}
}
//输入一条边所依附的两个顶点以及对应的权值,无向图的权值全为1
char v1 = '0';
char v2 = '0';
int w = 0;
int temp_i = 0;
int temp_j = 0;
for (int i = 0; i < mygraph.curArcNum; i++) {//循环边数次,总共需要输入curArcNum条边
cout << "请输入一条边所依附的两个顶点以及相应的权值" << endl;
cin >> v1 >> v2 >> w;
//找打这两个顶点在定点表中所对应的下标
temp_i = locateVex(mygraph, v1);
temp_j = locateVex(mygraph, v2);
if (temp_i != -1 && temp_j != -1) {
mygraph.arcs[temp_i][temp_j] = w;
mygraph.arcs[temp_j][temp_i] = w;
cout << "插入成功!" << endl;
}
}
}