AOE網(wǎng)求最短路徑的實(shí)驗(yàn)報(bào)告

《AOE網(wǎng)求最短路徑的實(shí)驗(yàn)報(bào)告》需解決的的問題設(shè)計(jì)一個AOE網(wǎng)，并求出關(guān)鍵路徑數(shù)據(jù)結(jié)構(gòu)的定義typedefstructarcnode{intadjvex;//活動末端structarcnode*nexarc;doubleinfo;//活動持續(xù)時間}arcnode;typedefstructvnode{intdata;//事件名arcnode*fristarc;intdu;//A度}vnode;typedefstruct{intvexnum;//事件個數(shù)intactnum;//活動個數(shù)vnode*program;}AOE;程序的結(jié)構(gòu)圖輸入事件數(shù)和活動數(shù)創(chuàng)建一個AOE網(wǎng)輸入事件數(shù)和活動數(shù)創(chuàng)建一個AOE網(wǎng)求出關(guān)鍵路徑程序結(jié)束函數(shù)的功能創(chuàng)建AOE網(wǎng)//建AOE網(wǎng)voidcreate(AOE*T){inti,start,end;doubletime;arcnode*p;T->program=(vnode*)malloc(T->vexnum*sizeof(vnode));if(!T->program) exit(0);for(i=0;i<T->vexnum;i++){T->program[i].data=i;T->program[i].du=0;T->program[i].fristarc=NULL;}printf("該項(xiàng)目的開始到結(jié)束在圖中的點(diǎn)輸入<i,j,info>\n");printf("如：4,5,9回車表示第四節(jié)點(diǎn)到第五節(jié)點(diǎn)之間的活動用了9個單位時間\n");for(i=0;i<T->actnum;i++){scanf("%d,%d,%lf”,&start,&end,&time);p=(arcnode*)malloc(sizeof(arcnode));p->adjvex=end-1;p->info=time;T->program[end-1].du++;p->nexarc=T->program[start-1].fristarc;T->program[start-1].fristarc=p;}}求關(guān)鍵路徑〃找關(guān)鍵路徑voidcrtical_activity(AOE*T){int*stack=(int*)malloc((T->vexnum+1)*sizeof(int));double*ve=(double*)malloc((T->vexnum)*sizeof(double));//諸存事件最早發(fā)生時間double*vl=(double*)malloc((T->vexnum)*sizeof(double));//儲存事件最晚發(fā)生時間double*e=(double*)malloc((T->actnum)*sizeof(double));//儲存活動最早開始時間double*l=(double*)malloc((T->actnum)*sizeof(double));〃儲存活動最晚開始時間inti,j,k,top=0,bottom=0;arcnode*p;doublesumtime=0.0;for(i=0;i<T->vexnum;i++)ve[i]=0.0;for(i=0;i<T->vexnum;i++){if(T->program[i].du==0)stack[top++]=i;}while(top!=bottom){i=stack[bottom++];p=T->program[i].fristarc;while(p){k=p->adjvex;T->program[k].du-;if(T->program[k].du==0)stack[top++]=k;if(ve[k]<ve[i]+p->info)ve[k]=ve[i]+p->info;p=p->nexarc;}}sumtime=ve[T->vexnum-l];for(i=0;i<T->vexnum;i++)vl[i]=ve[T->vexnum-l];for(i=T->vexnum-l;i>=0;i-)intk=stack[i];p=T->program[k].fristarc;while(p)j=p->adjvex;if((vl[j]-p->info)<vl[k])vl[k]=vl[j]-p->info;p=p->nexarc;}}printf("|起點(diǎn)|終點(diǎn)|最早開始時間|最遲開始時間|差|判斷|\n");i=0;for(j=0;j<T->vexnum;j++){p=T->program[j].fristarc;while(p){intk=p->adjvex;e[++i]=ve[j];l[i]=vl[k]-p->info;printf("|%4d|%4d|%lf|%lf|%lf|”,T->program[j].data+1,T->program[k].data+1,e[i],l[i],l[i]-e[i]);if(l[i]==e[i])printf("關(guān)鍵活動|\n");printf("\n");p=p->nexarc;}}printf('整個工程所用的最短時間為：%lf個單