数据结构课程设计-故宫导游咨询(最短路径)

w;?cout<<"输入路径的条数数和景点数:";?cin>>numE>>numV;?cout<<"输入景点名称:"<<endl;?for(i=0;i<numV;i++)?{ cout<<i+1<<":"; cin>>Vertices[i].dingdian; cout<<"景点信息:"; cin>>Vertices[i].xinxi;?}?for(i=0;i<numE;i++)?{ cout<<"输入景点到景点的路径的长度(vi,vj,length):"; cin>>vi>>vj>>w; Edge[vi-1][vj-1]=w; Edge[vj-1][vi-1]=w;?}}3.5修改操作voidGraph::xiugai(){?stringa,c;?intb=0;?cout<<"请输入要修改的景点:";?cin>>a;?for(inti=0;i<numV;i++) if(Vertices[i].dingdian==a) { cout<<"请重新输入景点信息:"; cin>>c; Vertices[i].xinxi=c; b++; cout<<"修改成功!"<<endl; } if(b==0) cout<<"不存在该景点!"<<endl;}3.6查询操作voidGraph::select(){?stringa;?intb=0;?cout<<"请输入要查询的景点:";?cin>>a;?for(inti=0;i<numV;i++) if(Vertices[i].dingdian==a) { cout<<Vertices[i].xinxi<<endl; b++; } if(b==0) cout<<"不存在该景点!"<<endl;}3.7删除操作voidGraph::delet(){?intx,y,z,k,v;?cout<<"请你输入要撤销景点数和路线条数:";?cin>>k>>z;