拓扑排序

#include<stdio.h>
#include<stdlib.h>
typedef struct _arcNode
{
    int adjvex;
    int weight;
    struct _arcNode *nextarc;
}arcNode;
typedef struct  _vNode
{
    char data;
    arcNode *firstarc;
}vNode;
#define  MaxVertexNum 100
typedef vNode adjList[MaxVertexNum];
typedef struct _adjGraph
{
    adjList ver;
    int e, n;
}adjGraph;
void createAdjGraph(adjGraph *G)
{
    scanf("%d,%d", &G->n, &G->e);
    getchar();
    for (int i = 0; i < G->n; i++)
    {
        scanf("%c ", &G->ver[i].data);
        G->ver[i].firstarc = NULL;
    }
    int a, b, w;
    for (int i = 0; i < G->e; i++)
    {
        scanf("%d,%d,%d", &a, &b, &w);
        arcNode *tmp = (arcNode*)malloc(sizeof(arcNode));
        tmp->weight = w;
        if (G->ver[a].firstarc == NULL)
        {
            tmp->adjvex = b;
            tmp->nextarc = NULL;
            G->ver[a].firstarc = tmp;
        }
        else
        {
            tmp->adjvex = b;
            tmp->nextarc = G->ver[a].firstarc;
            G->ver[a].firstarc = tmp;
        }
    }
}
typedef struct  _topoSequenceS
{
    char data[MaxVertexNum];
    int top;
}topoSequenceS;
topoSequenceS *topoS = (topoSequenceS*)malloc(sizeof(topoSequenceS));
void findInDegree(adjGraph *G, int *indegree)
{
    for (int i = 0; i < G->n; i++)
    {
        arcNode *arcPos = G->ver[i].firstarc;
        while (arcPos != NULL)
        {
            indegree[arcPos->adjvex] += 1;
            arcPos = arcPos->nextarc;
        }
    }
}
void topologicalSort(adjGraph *G)
{
    int *indegree = (int*)malloc(sizeof(int)*G->n);
    for (int i = 0; i < G->n; i++)
        indegree[i] = 0;
    findInDegree(G, indegree);
    int *tmpS = (int*)malloc(sizeof(int)*G->n);
    int top = -1;
    for (int i = 0; i < G->n; i++)
    {
        if (!indegree[i])tmpS[++top] = i;
    }
    topoS->top = -1;
    int i = 0;
    while (top != -1)
    {
        i=topoS->data[++topoS->top] = tmpS[top--];
        arcNode *arcPos = G->ver[i].firstarc;
        while (arcPos != NULL)
        {
            if (!(--indegree[arcPos->adjvex]))tmpS[++top] = arcPos->adjvex;
            arcPos = arcPos->nextarc;
        }
    }
}
#include<conio.h>
int main(void)
{
    freopen(".\\in.txt", "r", stdin);
    adjGraph *G = (adjGraph*)malloc(sizeof(adjGraph));

    createAdjGraph(G);
    fclose(stdin);
    for (int i = 0; i < G->n; i++)
    {
        printf("%c->", G->ver[i].data);
        arcNode *pos = G->ver[i].firstarc;
        while (pos != NULL)
        {
            printf("%c->", G->ver[pos->adjvex].data);
            pos = pos->nextarc;
        }
        printf("\n");
    }
    topologicalSort(G);
    if (topoS->top < G->n - 1)
        printf("Error!There is a circuit!\n");
    else
    {
        int vexNum = 0;
        int pos = 0;
        while (topoS->top != pos-1)
        {
            vexNum = topoS->data[pos];
            printf("%c\n", G->ver[vexNum].data);
            pos++;
        }
    }
    getch();
    return 0;
}