>num1>>num2; int mark[num1],point[num1],bpoint[num1]; //重要的辅助数组 for(int i=0;i>ming[i].a>>ming[i].b; twnum *tw,*uw,*gw; save *yw; tw=new twnum[num1]; uw=new twnum[num1]; yw=new save[num1]; gw=new twnum[num1]; for(int i=0;i>aa>>bb>>cc; d=locate(aa,ming,num1); e=locate(bb,ming,num1); tw[d].c[e].a=cc; tw[e].c[d].a=cc; point[d]++; point[e]++; bpoint[d]--; bpoint[e]--;} for(int i=0;i>aa; cout<<"终点简称";cin>>bb; cout<"; if(uu>1) {lc=lc+tw[lx1].c[lx2].a;lx1=lx2,lx2=c[uu];} } lc=lc+tw[lx2].c[b].a; cout<<"总路程:"<"<
项目作者: Beanson

项目描述 :
#include #include #include #include /* run this program using the console pauser or add your own getch, system("pause") or input loop */ using namespace std; #define length 30 typedef char lname[length]; typedef struct {lname a,b; }name; typedef struct {int a; int *b; }dada; typedef struct {dada *c; }twnum; typedef struct {twnum *w; }save; int location2(twnum *tw,int num1,int a,int b); void route(save *yw,twnum *tw,name *ming,int bpoint[],int num1); void copy(int isi,int rr,int r,int pp,save *yw); void dos(int i,int j,int point[],int mark[],twnum *tw,twnum *uw,save *yw,int rr,int &r,int isi,int &pp); int locate(lname aa,name *ming,int num1); int main(int argc, char** argv) { cout<<"请输入地点的个数以及两地点可以通路的路径条数"<>num1>>num2; int mark[num1],point[num1],bpoint[num1]; //重要的辅助数组 for(int i=0;i>ming[i].a>>ming[i].b; twnum *tw,*uw,*gw; save *yw; tw=new twnum[num1]; uw=new twnum[num1]; yw=new save[num1]; gw=new twnum[num1]; for(int i=0;i>aa>>bb>>cc; d=locate(aa,ming,num1); e=locate(bb,ming,num1); tw[d].c[e].a=cc; tw[e].c[d].a=cc; point[d]++; point[e]++; bpoint[d]--; bpoint[e]--;} for(int i=0;i>aa; cout<<"终点简称";cin>>bb; cout<"; if(uu>1) {lc=lc+tw[lx1].c[lx2].a;lx1=lx2,lx2=c[uu];} } lc=lc+tw[lx2].c[b].a; cout<<"总路程:"<"<
高级语言:
项目地址: git://github.com/Beanson/An-elemental--road-search-program.git