关键路径（critical path）.docVIP

关键路径（critical path） * Function for the critical path ==================================================== 1. using adjacency table storage, in the process of penetration can be calculated, and can also be considered 2. in the process of topological sorting, calculating the earliest time, save the degree of 0 points The same is in turn point, calculated at the edge of the table, because implied a relationship, selected, and directly connected to the side of the table number The 3. elements in the stack out of the stack, to get through the reduction, the latest time of occurrence 4. compared with the same point at the earliest time and the latest time are equal * / #include dos.h #include conio.h #include stdio.h #include stdlib.h #include string.h Maximum #define MAX_VERTEX_NUM 30 / / number of graphs. The maximum capacity of 30 MAX / #define stack #define INFINITY 30000; / / define the maximum late time of occurrence Typedef struct ArcNode { Int adjvex; / / the arc at the vertex position Int weight; / / the duration of the arc represents activities Struct ArcNode *nextarc; / / pointer to an arc }ArcNode; / / arc node Typedef struct { Int indegree[MAX_VERTEX_NUM]; / / storage of each vertex of the penetration ArcNode* AdjList[MAX_VERTEX_NUM]; / / pointer to the first attachment the vertex of arc Int vexnum, arcnum; / / the current vertex and arc number of graphs. }Graph; Typedef struct / / stack structure { Int elem[MAX]; / / stack area Int top; / / stack pointer }Stack; Int ve[MAX_VERTEX_NUM]; / / global variables, for each vertex of the earliest time Void FindInDegree (Graph G) {// calculate the vertex graph of G penetration, stored in G.indegree[1..G.vexnum] Int i; ArcNode* p; For (i=1; i=G.vexnum; i++) { G.indegree[i]=0; } For (i=1; i=G.vexnum; i++) { For (p=G.AdjList[i]; p; p=p-nextarc) / / a list to find, a loop, a linked list { G.indegree[p-adjvex]++; / / arc head vertex degree plus one } } } Void Initial (Stack S) { S.top=-1; / / the stack pointer is initiali