图关键路径(c语言)（Fig. critical path (C language)）.docVIP

图关键路径(c语言)（Fig. critical path (C language)） # includes stdio.h # includes stdlib.h # includes conio.h # includes string.h typedef struct arccell { int adj; / * 顶点关系类型, 用1表示相邻, 0表示不相邻 * / } arccell, * * adjmatrix 邻接矩阵; / * * / typedef struct type { char date [3]; / * 顶点值 * / int); / * 弧的长度 * / struct type * next; / * 顶点的下一个指针 * / } vertextype; typedef struct { vertextype * vexs 顶点向量; / * * / adjmatrix 邻接矩阵 arcs; / * * / int vexnum, arcnum 图的顶点数和边数; / * * / } mgraph; / * * * * * * * * * * * * * * * * * * * 8 * / typedef int status; # define stack _ init _ size 50 typedef int elemtype; typedef struct stack 定义栈类型 / * * / { elemtype * basis. elemtype * top; int stacksize; int length; } sqstack, * stack. void initstack (stack * s) / * 初始化栈 * / { * s = (sqstack *) malloc (sizeof (sqstack)); (*) - basis = (elemtype *) malloc (stack _ init _ size * sizeof (elemtype)); if (! (*) - base) exit (- 1). (*) - top = (* 5) - basis. (*) - stacksize = stack _ init _ size; (*) - length = 0; } status destroystack (stack * s) / * 销毁栈 * / { free (* 5) - basis); free (* 5)); return 1; } status stackempty (sqstack d 判断栈空否) / * * / { if (s.top = = s.base) return 1; else return 0; } void push (stack * s, elemtype and 把数据压入栈) / * * / { if ((s) - top - (*) - = (base * s) - stacksize) { (*) - basis = (elemtype realloc (*) (* 5) - base (*) - stacksize + 10) * sizeof (elemtype)); if (! (*) - base) exit (- 1). (*) - top = (* 5) - base + (* 5) - stacksize; (*) - stacksize + = 10; } * (*) - + + + + + + +) = and. + + + + + + + (* 5) - length; } status of pop (stack * s, elemtype * and 删除栈顶元素) / * * / { if ((s) - top = = * (s) - base) return 0; * = * (* 5) - top - 1); - (*) - length; (*) - top -. return 1; } / * * * * * * * * * * * * * * * * * * * * * * / void initgraph (mgraph * g) / * 初始图 * / {int i, nu, mu. printf (\ n输入顶点的个数和 (边) 弧的个数:); scanf (% d% d nu, mu); g - arcs = (arccell * *) malloc (nu * sizeof (arccell *)); for (i = 0; i nu; i + +) / * 分配邻接矩阵空间 * / g