数据结构之---C语言实现关键路径AOE图

//关键路径AOE
//杨鑫
#include   
#include 
#include 
//定义邻接表
typedef struct node  
{  
 	int  adjvex;  
 	int  w;  
 	struct node *nextedge;  
 }edgenode; 

//定义边集 
typedef struct
{  
      char     data;
      int      id;  
      edgenode  *firstedge;  
 }vexnode;   

void CreateGraph(vexnode* Graph,int vexnumber,int arcnumber)  
{  
     int i = 0, j = 0, k = 0;
	 int begin,end,duttem; 
	 char ch;
     edgenode *p;  
     for(i=0;i\n");  
    for(k=0;kadjvex =end-1;  
        p->w =duttem;