数据结构-拓扑排序代码实现（邻接表）

#include <iostream>
#include <iomanip>
using namespace std;


const int MAX_VERTEX_NUM = 20;  
typedef char VexType;//结点类型
typedef struct ArcNode {
	int adjvex;    //表内结点的点域部分，存储此处的顶点值
	struct ArcNode* nextarc; //表示此处顶点指向下一处顶点的弧
}ArcNode;
typedef struct VNode {//顶点表结点
	VexType data;  //顶点信息
	ArcNode* firstarc; //指向第一个表内结点的首指针
}VNode, AdjList[MAX_VERTEX_NUM];//顶点表，按位次存储所有结点
typedef struct {
	AdjList vertices;//顶点表
	int vexnum, arcnum; //图的当前顶点数和弧数
}ALGraph;

void CreateDG(ALGraph& G);
int LocateVex(ALGraph G, char v);//接收结点v，将他转变为在表中的位次，便于程序计算
void PrintAlGraph(ALGraph G);
void CountInDegree(ALGraph G);//计算每个结点的入度值
int FirstDegree0(ALGraph G);//寻找第一个未被访问且入度为0的结点，返回其位次
bool TopSort(ALGraph G);//拓扑排序

bool visited[MAX_VERTEX_NUM];//记录结点是否被访问过
int InDegree[MAX_VERTEX_NUM];//记录每个结点的入度值

int LocateVex(ALGraph G, char v) {
	for (int i = 0; i < G.vexnum; i++)
		if (G.vertices[i].data == v)
			return i;
	return -1;
}
void CreateDG(ALGraph& G) {
	char v1, v2;//接收输入顶点，在LocateVex中转为位次
	ArcNode* pi, * pj;//pi指结点i指向的结点，pj指结点j指向的结点
	cout << "请依次输入图G的顶点数、弧数：";
	cin >> G.vexnum >> G.arcnum;
	cout << "请输入各顶点信息：";
	for (int i = 0; i < G.vexnum; i++) { //建立顶点表，依次输入顶点值
		cin >> G.vertices[i].data;   //输入顶点值
		G.vertices[i].firstarc = NULL;	//初始化链表头指针为空
	}
	cout << "请输入活动起始点、终止点：" << endl;
	for (int k = 0; k < G.arcnum; k++) {//按照边数，将每条边都输入
		cin >> v1 >> v2;
		int i = LocateVex(G, v1);
		int j = LocateVex(G, v2);
		//以下插入方式类似于单链表头插法
		pi = new ArcNode; pi->adjvex = j; //结点i指向的点是结点j
		pi->nextarc = G.vertices[i].firstarc;//结点i指向的点的next点仍是结点i指向的点
		G.vertices[i].firstarc = pi;  //更新G.vertices[i]首指针
		//无向图a指向b的同时b也指向a
		//pj = new ArcNode; pj->adjvex = i; //结点j指向的点是结点i
		//pj->nextarc = G.vertices[j].firstarc;
		//G.vertices[j].firstarc = pj; //更新G.vertices[j]首指针
	}
}
void PrintAlGraph(ALGraph G) {
	for (int i = 0; i < G.vexnum; i++) {
		cout << G.vertices[i].data << "->";
		ArcNode* p = G.vertices[i].firstarc;
		while (p) {
			cout << p->adjvex << "  ";
			p = p->nextarc;
		}
		cout << endl;
	}
}
void CountInDegree(ALGraph G){
	for (int i = 0; i < G.vexnum; i++) //初始化所有结点入度为0
		InDegree[i] = 0;
	for (int i = 0; i < G.vexnum; i++)//计算每个结点的入度
		for (ArcNode* p = G.vertices[i].firstarc; p; p = p->nextarc)
			InDegree[p->adjvex]++;
}
int FirstDegree0(ALGraph G){
	for (int i = 0; i < G.vexnum; i++)
		if (!visited[i] && InDegree[i] == 0)
			return i;
	return -1;
}

bool TopSort(ALGraph G) {
	int count = 0;//记录访问过的结点数量
	CountInDegree(G); //取入度为0的顶点v;
	for (int i = 0; i < G.vexnum; i++) //初始化所有结点未被访问过
		visited[i] = false;
	int v = FirstDegree0(G);//结点v入度为0
	while (v != -1) { //尚有入度为零的顶点存在
		cout << setw(3) << G.vertices[v].data; visited[v] = true; count++;
		for (ArcNode* p = G.vertices[v].firstarc; p; p = p->nextarc) {
			if (visited[p->adjvex] == false) //p->adjvex为v的邻接点
				InDegree[p->adjvex]--;  //p->adjvex的入度减一
		}
		v = FirstDegree0(G); //取下一个入度为0的顶点v;
	}
	if (count < G.vexnum) return false;//判断是否所有结点均访问过了

}



int main()
{
	ALGraph S;
	cout << "*********构造有向图（邻接表）*********" << endl;
	CreateDG(S);
	cout << "该图的邻接表为：" << endl;
	PrintAlGraph(S);
	cout << "*********拓扑排序*********" << endl;
	if (!TopSort(S))
		cout << "\n图中有回路,不能进行拓扑排序！" << endl;
	return 0;
}

实验样例