拓扑排序

使用邻接表存储图。

---

#include<bits/stdc++.h>
using namespace std;

#define MAXSIZE 100

int inDegree[MAXSIZE]; //入度

/*
邻接表定义
*/
typedef struct ArcNode{
    int data;
    struct ArcNode *nextArc;
}ArcNode;

typedef struct VNode{
    int data;
    ArcNode *firstArc;
}VNode,Adjlist;

typedef struct ALGraph{
    Adjlist vertices[MAXSIZE];
    int vexnum,arcnum;
}ALGraph;

/*
创建图（邻接表存储）
*/
void CreateALGraph(ALGraph &g){
    cout<<"Now create ALGraph: vexnum arcnum"<<endl;
    cin>>g.vexnum>>g.arcnum;
    for(int i=1;i<=g.vexnum;i++){
        g.vertices[i].firstArc=NULL;
        g.vertices[i].data=i;
    }
    //输入边
    cout<<"Now input the arcs:"<<endl;
    for(int i=0;i<g.arcnum;i++){
        //cout<<"input arc"<<i+1<<":";
        int u,v;
        cin>>u>>v;
        inDegree[v]++;  //入度++
        if (g.vertices[u].firstArc==NULL){
            //cout<<"new firstArc"<<endl;
            ArcNode *q=(ArcNode*)malloc(sizeof(ArcNode));
            q->data=v;
            q->nextArc=NULL;
            g.vertices[u].firstArc=q;

        }
        else{
            ArcNode *p=g.vertices[u].firstArc;
            while (p->nextArc!=NULL){
                p=p->nextArc;
            }
            ArcNode *q=(ArcNode*)malloc(sizeof(ArcNode));
            q->data=v;
            q->nextArc=NULL;
            p->nextArc=q;
        }
    }

    //输出邻接表
    cout<<endl<<"Now output arcs info:"<<endl;
    for (int i = 1; i <= g.vexnum; i++){
        cout<<"vertex "<<g.vertices[i].data<<" :";
        ArcNode *p=g.vertices[i].firstArc;
        while (p!=NULL){
            cout<<p->data<<" ";
            p=p->nextArc;
        }
        cout<<endl<<endl;
    }
}


/*
拓扑排序
*/
bool TopologicalSort(ALGraph g){
    int stack[MAXSIZE];
    int top=-1;

    for(int i=1;i<g.vexnum;i++){
        if(inDegree[i]==0){
            stack[++top]=i;
        }
    }

    int count=0;    //记录输出节点数
    while (top!=-1)
    {
        int pnum=stack[top--];  //定点表位置
        cout<<g.vertices[pnum].data<<" ";
        count++;
        ArcNode* p=g.vertices[pnum].firstArc;
        while (p!=NULL)
        {
            inDegree[p->data]--;
            if (inDegree[p->data]==0)
            {
                stack[++top]=p->data;
            }
            p=p->nextArc;
        }
    }
    if (count<g.vexnum) //排序失败，有回路
    {
        return false;
    }
    else
    {
        return true;
    }
}

int main(){
    ALGraph g;
    
    for(int i=0;i<MAXSIZE;i++){ //初始化inDegree
        inDegree[i]=0;
    }
    
    CreateALGraph(g);
    
    if(TopologicalSort(g)){		//能否得到拓扑排序序列
        cout<<"True"<<endl;
    }
    else{
        cout<<"False"<<endl;
    }
    
    return 0;
}

/*
6 14
1 2
1 4
2 1
2 3
2 5
3 2
3 4
3 5
4 1
4 3
5 2
5 3
5 6
6 5
*/