管道铺设施工的最佳方案问题

i].z-1]==1)Рreturn 3;Рelse if(vp->visited[w->e[i].z-1]==1&&vp->visited[w->e[i].y-1]==1)Рreturn 4;Р }Рvoid Create_TLGraph(WGraph *w,ALGraph *G)Р{WGraph T;Р int i,j,t,h,k=2;Р int m=1; int abc,bcd;Р struct visit *vp;Р vp=(struct visit *)malloc(sizeof(struct visit));Р for(i=0;i<(G->n);i++)Р {vp->visited[i]=-1;Р vp->position[i]=-1;Р vp->vvpp[i][0]=i+1;Р for(j=1;j<G->n;j++)Р vp->vvpp[i][j]=0;Р }Р T.v[0]=w->v[w->e[0].z-1];Р T.v[1]=w->v[w->e[0].y-1];Р vp->visited[w->e[0].z-1]=1;Р vp->position[w->e[0].z-1]=w->e[0].z;Р for(j=0;j<(G->n);j++)Р if(vp->vvpp[w->e[0].z-1][j]==0)Р {vp->vvpp[w->e[0].z-1][j]=w->e[0].y;Р break;}Р vp->visited[w->e[0].y-1]=1;Рvp->position[w->e[0].y-1]=w->e[0].z;Р T.e[0].info=w->e[0].info;Р T.e[0].z=w->e[0].z;Р T.e[0].y=w->e[0].y;Р for(i=1;i<(G->e);i++)Р {t=judge_vertex(w,i,vp);