邻接表关键路径

此代码是数据结构的原始模板，可以刚接触或考研时借鉴下，不适于刷题

#include<stdio.h>
#include<malloc.h>
#include<stack>
using namespace std;
#define MAX_VERTEX_NUM 20
int visited[100];
int ve[MAX_VERTEX_NUM];
stack<int>T;
typedef struct arcnode
{
	int adjvex;
	struct arcnode *nextarc;
	int info;
}*arcnod,arcnode1;
typedef struct vertexnode
{
	int data;
	arcnode1 *firstarc;
}*vertexnod,vertex;
typedef struct 
{
	vertex ver[MAX_VERTEX_NUM];
	int vexnum,arcnum;
}*adjlist,adjlist1;

int find(adjlist &g,int x)
{
	int x1;
	for(int i=0;i<g->vexnum;i++)
	{
		if(g->ver[i].data==x)
		{
           x1=i;
		   break;
		}
	}
	return x1;
}
void create(adjlist &g)
{
	int i,k=1,x1,x2,weight;
	arcnod s1;
	printf("请输入顶点数和边数: ");
	scanf("%d%d",&g->vexnum,&g->arcnum);
	printf("请输入顶点信息: ");
	for(i=0;i<g->vexnum;i++)
	{
		scanf("%d",&g->ver[i].data);
		g->ver[i].firstarc=NULL;
	}
	for(i=0;i<g->arcnum;i++)
	{ 
		adjlist g1,g2;
		g1=g;
		g2=g;
		printf("请输入第%d边的起点，终点,表示顶点起点到终点及其权值: ",k++);
		scanf("%d%d%d",&x1,&x2,&weight);
        int t1=x1,t2=x2;
		x1=find(g1,x1);
		x2=find(g2,x2);
	    s1=(arcnod)malloc(sizeof(arcnode1));
		s1->info=weight;
		s1->adjvex=x2;
		s1->nextarc=g->ver[x1].firstarc;
		g->ver[x1].firstarc=s1;
	}
}
void findID(adjlist &g,int indegree[MAX_VERTEX_NUM])
{
	int i;
    arcnod p;
	for(i=0;i<g->vexnum;i++)
	indegree[i]=0;
	for(i=0;i<g->vexnum;i++)
	{
		p=g->ver[i].firstarc;
		while(p!=NULL)
		{
			indegree[p->adjvex]++;
			p=p->nextarc;
		}
	}
}
int topoorder(adjlist &g)
{
	int count,i,k,k0;
    arcnod p;
	int indegree[MAX_VERTEX_NUM];
	stack<int>S;
	findID(g,indegree);
	for(i=0;i<g->vexnum;i++)
	if(indegree[i]==0)
	S.push(i);
	count=0;
	for(i=0;i<g->vexnum;i++)
	ve[i]=0;
	while(!S.empty())
	{
       k0=S.top();
	   S.pop();
	   T.push(k0);
	   count++;
	   p=g->ver[k0].firstarc;
	   while(p!=NULL)
	   {
		   k=p->adjvex;
		   if(--indegree[k]==0)
		   S.push(k);
		   if(ve[k0]+p->info>ve[k])
		   ve[k]=ve[k0]+p->info;
		   p=p->nextarc;
	   }
	}
	if(count<g->vexnum)
		return 0;
	else
		return 1;
}
int criticalpath(adjlist &g)
{
	arcnod p;
	int i,j,k,k0,dut,ei,li;
	char tag;
	int vl[MAX_VERTEX_NUM];
	
	if(!topoorder(g))
	return 0;
	for(i=0;i<g->vexnum;i++)
		vl[i]=ve[g->vexnum-1];
	while(!T.empty())
	{
		k0=T.top();
		T.pop();
		p=g->ver[k0].firstarc;
		while(p!=NULL)
		{
			k=p->adjvex;
			dut=p->info;
			if(vl[k]-dut<vl[k0])
			vl[k0]=vl[k]-dut;
			p=p->nextarc;
		}
	}
	for(j=0;j<g->vexnum;j++)
	{
		p=g->ver[j].firstarc;
		while(p!=NULL)
		{
			k=p->adjvex;
			dut=p->info;
			ei=ve[j];
			li=vl[k]-dut;
			tag=(ei==li)?'*':' ';
			printf("%d,%d,%d,%d,%d,%c\n",g->ver[j].data,g->ver[k].data,li,dut,ei,tag);
			p=p->nextarc;
		}
	}
	return 1;
}
int main()
{
	adjlist g;
	g=(adjlist)malloc(sizeof(adjlist1));
    create(g);
	int t=criticalpath(g);
	printf("[%d]\n",t);
	return 0;
}