}//求解关键路径voidcritical_path(GraphMtx* g){intn = g->NumVertices;//最早开始时间数组int* ve = (int*)malloc(sizeof(int) * n);//最晚开始时间数组int* vl = (int*)malloc(sizeof(int) * n); assert(NULL!= ve &&NULL!= vl);for(inti =0; i < n; ++i){ ve[i] =0; vl[i]...
摘要 通过AOE(activity on edge)网络的邻接矩阵,构建一个算法求出EVM(earned value management)矩阵用于求解AOE网络中所有的工作路径以及关键路径.与传统算法相比,该算法实现简便,求解路径全面.考... 关键词 AOE网;邻接矩阵;关键路径;EVM矩阵 被引量 3
EgetWeight(GraphMtx*g,intv1,intv2){ if(v1==-1||v2==-1)return0; returng->Edge[v1][v2]; } //求解关键路径 voidcritical_path(GraphMtx*g){ intn=g->NumVertices; //最早开始时间数组 int*ve=(int*)malloc(sizeof(int)*n); //最晚开始时间数组 int*vl=(int*)malloc(sizeof(int)*n...