关键 路径代码算法.docxVIP

#includestdio.h#includestdlib.h#define stack_max_size 100#define stack_extra 10typedefstruct{int *top;int *base;intstacksize;}vexstack,*pvexstack;intinitstack(vexstack st){st.base=(int *)malloc(stack_max_size*sizeof(int));if(!st.base )exit(0);st.top =st.base ;st.stacksize =stack_max_size;return 1;}int pop(vexstack st,int a){if(st.top==st.base)return 0;a=*(--st.top);return 1;}int push(vexstack st,int a){if(st.top -st.base =st.stacksize ){st.base=(int*)realloc(st.base ,(stack_max_size+stack_extra)*sizeof(int));if(!st.base )exit(0);st.top=st.base+st.stacksize;st.stacksize+=stack_extra;}*st.top++=a;return 1;}intdestroystack(vexstack st){free(st.base );return 1;}intemptystack(vexstackst){if(st.top ==st.base)return 1;else return 0;}typedefstruct narc{intadjvex;int info;}narc,*pnarc;typedefstructheadvexter{intindegree;intkaiguan;intoutdegree;char data;pnarcoutarc;}headvexter,* pheadvexter;typedefstruct{intvexnum;pheadvextervexs;}graph,*pgraph;voidinitgraph(graph G){int i=0,j,k=0,n,l=0;char c[100];printf(请输入有向图的节点：\n);gets(c);while(c[i]!=\0) {i++;}G.vexnum=i;G.vexs=(pheadvexter)malloc((i+1)*sizeof(headvexter));i=0;while(c[i]!=\0){G.vexs[i+1].data =c[i];G.vexs[i+1].kaiguan=0;i++;} n=i;for(j=1;j=n;j++){printf(请输入节点%c的入度：,G.vexs[j].data);scanf(%d,G.vexs[j].indegree);printf(请输入节点%c的出度：,G.vexs[j].data);scanf(%d,G.vexs[j].outdegree);G.vexs[j].outarc=(pnarc)malloc((G.vexs[j].outdegree+1)*sizeof(narc));for(i=1;i=G.vexs[j].outdegree;i++){printf(%c节点的第%d条弧对应的邻接点所对应的序号为：,G.vexs[j].data,i);scanf(%d,G.vexs[j].outarc[i].adjvex);printf(%c节点的第%d条弧所带的信息为：,G.vexs[j].data,i);scanf(%d,G.vexs[j].outarc[i].info);}}}inttopologicalorder(graph G,vexstack s,int *ve,int max){int i=1,j,k,count=0;ve=(int*)malloc((G.vexnum+1)*sizeof(int));while(i=(G.vexnum+1)){ve[i++]=0;}for(i=1;i=G.vexnum;i++){if((G.vexs[i].indegree==0)G.vexs[i].kaiguan==0){push(s,i); G.vexs[i].kaiguan=1;count++;}for(j=1;j=G.vexs[i].outdegree;j++) { k=G.vexs[i].outarc[j].adjvex;if(ve[i]+G.vexs[i].outarc[j].infove[k])