有向无环网拓扑排序
针对有向无环图!
**有向无环图:**无环的有向图,简称DAG图(Directed Acycline Graph)
#include <iostream>
#include<cmath>
#define OK 1
#define ERROR 0
#define TRUE 1
#define FALSE 0
#define MAXSIZE 100
//定义无穷大
#define MAXInt 32767
typedef int Status;
typedef char TElemType;
using namespace std;
//定义顶点数据类型
typedef char VerTexType;
//定义边的数据类型
typedef int ArcType;
//定义图的数据结构
typedef struct {
//顶点表
VerTexType vexs[MAXSIZE];
//邻接矩阵
ArcType arcs[MAXSIZE][MAXSIZE];
//当前结点数和当期边数
int vexnum, arcnum;
}AMGraph; //Adjacency(邻接) Matrix Graph
//函数输入一个顶点的值,返回该顶点在顶点表中的下标,不存在则返回-1
int LocateVex(VerTexType x, AMGraph& G) {
for (int i = 0; i < G.vexnum; i++)
{
if (x == G.vexs[i])
{
return i;
}
}
return -1;
}
void createUDN(AMGraph& G) {
//先输入图的顶点数和边数
cout << "请输入要创建的有向图的顶点数和边数:" << "\n";
scanf_s("%d%d", &G.vexnum, &G.arcnum);
//依次输入各个顶点的值
cout << "依次输入各个顶点的值" << "\n";
for (int i = 0; i < G.vexnum; i++) {
cin >> G.vexs[i];
}
//对邻接矩阵进行初始化
for (int i = 0; i < G.vexnum; i++) {
for (int j = 0; j < G.vexnum; j++) {
G.arcs[i][j] = 0;
}
}
cout << "请输入每条边的顶点和权值:输入方式:起点 终点" << "\n";
//输入依次输入每一条边的顶点和权值
for (int i = 0; i < G.arcnum; i++)
{
VerTexType a, b;
ArcType weight;
cin >> a >> b;
//找到输入的顶点a,b在顶点表中的下标
int x = LocateVex(a, G);
int y = LocateVex(b, G);
if (x != -1 && y != -1) {
G.arcs[x][y] = 1;
//G.arcs[y][x] = weight;
}
}
}
//输出顶点表以及邻接矩阵
void outPut(AMGraph G) {
cout << "顶点表如下:" << "\n";
for (int i = 0; i < G.vexnum; i++) {
printf("%c ", G.vexs[i]);
}
printf("\n输出邻接矩阵如下\n");
for (int i = 0; i < G.vexnum; i++)
{
for (int j = 0; j < G.vexnum; j++)
{
printf("%6d", G.arcs[i][j]);
}
printf("\n");
}
}
typedef struct {
int topo[MAXSIZE];//用来记录已经加入线性序列的顶点的下标
int length;//现在已经加入线性序列的顶点集的长度
}TopoStruct;
//判断顶点x是否已经存在于拓扑序列中
bool IsInTopo(TopoStruct t, int x) {
for (int i = 0; i <t.length; i++)
{
if (t.topo[i]==x)
{
return true;
}
}
return false;
}
//拓扑排序
void topologicalSort(TopoStruct &t,AMGraph G) {
//定义一个flag标记判断这次查找是否有不存在前驱的顶点
bool flag = true;
do {
flag = false;//初始化为没有找到无前驱的顶点
//找一个没有前驱的顶点
//即i从0~G.vexnum-1的G[i][j]都为无穷大的顶点j,即入度为0的顶点
//而且还要不在已经加入线性序列的顶点
for (int j = 0; j < G.vexnum; j++) {
if (!IsInTopo(t,j))//j顶点不在拓扑序列中
{
int i = 0;
for ( i= 0; i < G.vexnum; i++)
{
if (G.arcs[i][j]!= 0)
{
break;
}
}
if (i==G.vexnum)//说明j顶点的入度为0
{
//找到了这个没有前驱的顶点,修改flag标记
flag = true;
//加入拓扑序列中
t.topo[t.length++] = j;
//删除所有以j为顶点的弧,即j为下标的行全部的权值设置为maxInt
for (int k = 0; k < G.vexnum; k++) {
G.arcs[j][k] = 0;
}
}
}
}
} while (flag);
}
int main() {
AMGraph G;
createUDN(G);
outPut(G);
TopoStruct t;
t.length = 0;
topologicalSort(t, G);
printf("\n");
for (int i = 0; i < t.length ; i++)
{
printf("%4c ", G.vexs[t.topo[i]]);
}
printf("\n");
return 0;
}
测试样例: