有向无环图的关键路径.doc

有向无环图的关键路径.txt51自信是永不枯竭的源泉，自信是奔腾不息的波涛，自信是急流奋进的渠道，自信是真正的成功之母。#includeiostream #includestring #includestack using namespace std; #define MAX_VERTEX_NUM 20 typedef struct ArcNode{ int adjvex; //该弧所指向的顶点的位置 struct ArcNode *nextarc; //指向下一条弧的指针 int info; //弧上的信息 // string info; //该弧相关信息 }ArcNode; typedef struct VNode{ int data; //顶点信息 ArcNode *firstarc; //指向第一条依附该顶点的弧的指针 }VNode,AdjList[MAX_VERTEX_NUM]; typedef struct{ AdjList vertices; //存储图 int venum,arcnum; //图的当前顶点数和弧数 int kind; //图的种类标志 }ALGraph; int InDegree[MAX_VERTEX_NUM]={0}; //用于拓扑排序 int CreateUG(ALGraph G){ cout请输入图中顶点个数和边数:; cinG.venumG.arcnum; int i; for( i=0; iG.venum; i++){ G.vertices[i].data=i+1; G.vertices[i].firstarc=NULL; } for( i=0; iG.arcnum; i++){ cout请输入你要加入的边的信息:; int v1, v2; cinv1v2; ArcNode* current=G.vertices[v1-1].firstarc; ArcNode* p=G.vertices[v1-1].firstarc; if(current==NULL){ G.vertices[v1-1].firstarc=new ArcNode; G.vertices[v1-1].firstarc-adjvex=v2-1; G.vertices[v1-1].firstarc-nextarc=NULL; } else{ while(current!=NULL){ p=current; current=current-nextarc; } current=new ArcNode; current-adjvex=v2-1; current-nextarc=NULL; p-nextarc=current; } current=G.vertices[v2-1].firstarc; p=G.vertices[v2-1].firstarc; if(current==NULL){ G.vertices[v2-1].firstarc=new ArcNode; G.vertices[v2-1].firstarc-adjvex=v1-1; G.vertices[v2-1].firstarc-nextarc=NULL; } else{ while(current!=NULL){ p=current; current=current-nextarc; } current=new ArcNode; current-adjvex=v1-1; current-nextarc=NULL; p-nextarc=current; } } return 1; } int CreateDG(ALGraph G){ cout请输入图中顶点个数和边数:; cinG.venumG.arcnum; int i; for( i=0; iG.venum; i++){ G.vertices[i].data=i+1; G.vertices[i].firstarc=NULL; } for( i=0; iG.arcnum; i++){ cout请输入你要加入的边的信息:; int v1, v2