AOV网的实现（数据结构）

#include <stdio.h>
#include <stdlib.h>
#include <string.h>//我这里的头以及尾巴与书上的不一样。
int max(int a, int b)
{
    return a > b?a:b;
}
int min(int a, int b)
{
    return a < b?a:b;
}
typedef struct ArcNode
{
    int from, to;
    struct ArcNode * fnext, *tonext;
    int w;
}ArcNode;
typedef struct VertexNode
{
    char info;
    ArcNode *ff, *ft;
}VertexNode;
typedef struct Graph
{
    int num_vertex;
    int num_arc;
    VertexNode *ver;
}Graph;
Graph *Create(int n)
{
    Graph * G = (Graph*)malloc(sizeof(Graph));
    G->num_vertex = n;
    G->num_arc = 0;
    G->ver = (VertexNode*)calloc(n+1, sizeof(VertexNode));
    for(int i = 1; i <= n; i++)
    {
        G->ver[i].ff = NULL;
        G->ver[i].ft = NULL;//在这里可以补加点的信息
    }
    return G;
}
void AddArc(Graph *G,int a, int b, int c)
{
    (G->num_arc)++;
    ArcNode *s = (ArcNode*)malloc(sizeof(ArcNode));
    s->from = a;
    s->to = b;
    s->fnext = G->ver[a].ff;
    G->ver[a].ff = s;
    s->tonext = G->ver[b].ft;
    G->ver[b].ft = s;
    s->w = c;
}

//手写一个栈
typedef struct stack{
    int *data;
    int cnt;
    int max;
}Stack;
Stack *Create_Stack(int max)
{
    Stack *s = (Stack*)malloc(sizeof(Stack));
    s->cnt = -1;
    s->data = (int *)calloc(max, sizeof(int));
    s->max = max;
    return s;
}
void Pop_Stack(Stack *S)
{
    if(S->cnt > -1)
        S->cnt--;
}
void Push_Stack(Stack *S, int e)
{
    if(S->cnt < S->max)
    {
        S->cnt++;
        S->data[S->cnt] = e;
    }
}
int Top_Stack(Stack *S)
{
    if(S->cnt > -1)
    {
        return S->data[S->cnt];
    }
    return 0x3f3f3f3f;
}
void Destory_Stack(Stack *S)
{
    free(S->data);
    free(S);
}
int Empty_Stack(Stack *S)
{
    if(S->cnt == -1)
        return 1;
    return 0;
}


//进行topo排序
int TopoSort(Graph *G, int *arr)
{
    int total = 0;
    Stack* s = Create_Stack(G->num_vertex+2);
    int *in = (int *)calloc(G->num_vertex+1,sizeof(G));
    for(int i = 1; i <= G->num_vertex; i++)
    {
        int cnt = 0;
        for(ArcNode *A = G->ver[i].ft; A; A = A->tonext)
            cnt++;
        in[i] = cnt;
        if(cnt == 0)
            Push_Stack(s, i);
    }
    while(!Empty_Stack(s))
    {
        int t = Top_Stack(s);
        arr[++total] = t;
        Pop_Stack(s);
        for(ArcNode *A = G->ver[t].ff; A; A = A->fnext)
        {
            in[A->to]--;
            if(in[A->to]==0)
                Push_Stack(s, A->to);
        }
    }
    free(in);
    Destory_Stack(s);
    if(total != G->num_vertex)
        return 1;
    return 0;
}


void AOE(Graph *G)
{
    int *topo = (int *)calloc(G->num_vertex+2, sizeof(int));
    int *ve = (int *)calloc(G->num_vertex+1, sizeof(int));
    int *vl = (int *)calloc(G->num_vertex+1, sizeof(int));
    for(int i = 1; i <= G->num_vertex; i++)
    {
        ve[i] = 0;
        vl[i] = 0x3f3f3f3f;
    }
    if(TopoSort(G, topo))
        printf("该任务出现闭环！！！");
        //计算ve

    ve[1] = 0;

    for(int i = 2; i <= G->num_vertex; i++)//注意是以2开始
    {
        for(ArcNode *A = G->ver[topo[i]].ft; A; A = A->tonext)
        {
            ve[topo[i]] = max(ve[topo[i]],ve[A->from]+A->w);
        }
    }
         //计算vl
    vl[G->num_vertex] = ve[G->num_vertex];
    for(int i = G->num_vertex; i >= 1; i--)
    {
        for(ArcNode *A = G->ver[topo[i]].ft; A; A = A->tonext)
        {
            vl[A->from] = min(vl[A->from], vl[A->to]-A->w);
        }
    }
    for(int i = 1; i <= G->num_vertex; i++)
    {
        for(ArcNode *A = G->ver[topo[i]].ff; A; A = A->fnext)
        {
            printf("%d ----> %d:\n",A->from, A->to);
            printf("最早：%d\t最迟：%d\t",ve[A->from], vl[A->to]-A->w);
            if(ve[A->from]==vl[A->to]-A->w)
                printf("关键活动\n");
            else
                printf("非关键活动，松弛时间：%d\n",vl[A->to]-A->w-ve[A->from]);
        }
    }
    free(topo);
    free(ve);
    free(vl);
}
int main()//要求：第一个序号代表源点， 最后一个(n号）代表汇点
{
    //要求：第一个序号代表源点， 最后一个(n号）代表汇点
    //要求：第一个序号代表源点， 最后一个(n号）代表汇点
    //要求：第一个序号代表源点， 最后一个(n号）代表汇点
    int n,m;
    scanf("%d",&n);
    Graph *G = Create(n);
    scanf("%d",&m);
    for(int i = 1; i <= m; i++)
    {
        int a,b,c;
        scanf("%d%d%d",&a, &b, &c);
        AddArc(G,a,b,c);
    }
    AOE(G);
    return 0;
}
/*测试用例
9 11
1 2 6
1 3 4
1 4 5
2 5 1
3 5 1
4 6 2
5 7 9
5 8 7
6 8 4
8 9 4
7 9 2

*/