轻量级工作流系统全部代码及设计报告.docVIP

#include stdio.h #include iostream #include string #includewindows.h using namespace std; const int max=21; //最多节点数； #define v_type char //节点类型； typedef int a_type; //边类型； typedef struct matrix{ v_type vertex[max+2][31]; a_type arc[max][max]; int indegree[max],outdegree[max]; int v_number,a_number; }matrix; //邻接矩阵； typedef struct Queue{ v_type elem[max][31]; int top,tail; }Queue; //队列； void InitQueue(Queue Q) { Q.top = 0; Q.tail = 0; return; } bool EmptyQueue(Queue Q) { if(Q.top == Q.tail) return true; return false; } void OutQueue(Queue Q,v_type *ch) { strcpy(ch,Q.elem[Q.top]); Q.top = (Q.top+1)%max; } void EnQueue(Queue Q,v_type *ch) { strcpy(Q.elem[Q.tail],ch); Q.tail = (Q.tail+1)%max; } void InitMatrix(matrix M,char(*value)[20]) { int t = 0; while(value[t][0]!=\0) { strcpy(M.vertex[t],value[t]); t++; } M.v_number = t; int i,j; for(i=0;iM.v_number;i++) { for(j=0;jM.v_number;j++) { M.arc[i][j] =-1; } } M.a_number=0; for(i=0;imax;i++) { M.indegree[i] = M.outdegree[j] = 0; } M.a_number = 9; M.arc[0][1] = 1; M.outdegree[0]++; M.indegree[1]++; M.arc[0][2] = 3; M.outdegree[0]++; M.indegree[2]++; M.arc[0][3] = 7; M.outdegree[0]++; M.indegree[3]++; M.arc[0][4] = 30; M.outdegree[0]++; M.indegree[4]++; M.arc[5][6] = 0; M.outdegree[5]++; M.indegree[6]++; for(j=1;i=4;i++) { M.arc[i][5] = 1; M.outdegree[i]++; M.indegree[5]++; } } void All_Node(matrix M) { int COUNT; COUNT = 0; Queue Q; InitQueue(Q); int sign[max]; int i = 0; while(imax) { sign[i] = 0; i++; } i=0; while(iM.v_number) { if(M.indegree[i]==0) { if(sign[i]==0) { EnQueue(Q,M.vertex[i]); COUNT+=1; int j=0; while(jM.v_number) { if(M.arc[i][j]!=-1) M.indegree[j]-=1; j++; }//while sign[i]=1; i=0; continue; } } i++; }//while if(M.v_number!=COUNT) { MessageBox(NULL,TEXT(存在有向环!!),TEXT(Error),MB_OK); } v_type value[31]; for(;EmptyQueue(Q)!=true;) {