- 类定义:
void CreateGraph(ALGraph &G) { int i,j,k; char vi,vj; WeightType weight; ArcNode*p,*q; std::cout<<"请输入顶点个数,边数和图的类型:\n"; std::cin>>G.vexnum >>G.arcnum >>G.kind ; for(i=0;i<G.vexnum ;i++) { std::cout<<"请输入各个顶点:\n"; std::cin>>G.vertices[i].data ; G.vertices[i].firstarc=NULL; } for(k=0;k<G.arcnum ;k++) { std::cout<<"请输入两顶点和其边的权值:\n"; std::cin>>vi>>vj>>weight; i=LocateVex(G,vi); j=LocateVex(G,vj); p=(ArcNode*)malloc(sizeof(ArcNode)); p->adjvex=j; p->weight=weight; p->nextarc=G.vertices [i].firstarc; G.vertices [i].firstarc=p; if(G.kind == 2) { q=(ArcNode*)malloc(sizeof(ArcNode)); q->adjvex=i; q->weight=p->weight; q->nextarc=G.vertices [j].firstarc; G.vertices [j].firstarc=
数据结构课程设计:管道铺设施工的最佳方案代码
最新推荐文章于 2023-09-10 15:45:49 发布