拓扑排序算法

拓扑排序算法

/实验内容：
1.创建一张有向网；
2.给出该图的拓扑有序序列；/
#include “stdio.h”
#include “malloc.h”
#include<stdlib.h>
#define MAXLEN 40
typedef int SElemType;
typedef int Status;
#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define OVERFLOW -1
typedef char VEXTYPE;
typedef struct node
{
int adjvex;
struct node *next;
}ARCNODE;
typedef struct
{
int InDegree,OutDegree;
char data;
ARCNODE *firstarc;
}VEXNODE;
typedef struct
{
VEXNODE vertices[MAXLEN];
int vexnum, arcnum;
}ALGRAPH;
ALGRAPH creat_graph()//创建一张图
{
int i,j,k;
ALGRAPH G;
ARCNODE *s;
printf(“请输入顶点和弧的个数(用逗号隔开)：”);
scanf("%d,%d",&G.vexnum,&G.arcnum);
for (i=0;i<G.vexnum;i++)
{
printf(“请输入第%d个顶点的值：”,i+1);
fflush(stdin);/fflush(stdin)是用来清空输入缓冲区,通常是为了确保不影响后面的数据读取,
例如在读完一个字符串后紧接着又要读取一个字符,此时应该先执行fflush(stdin)。/
scanf("%c",&G.vertices[i].data);
G.vertices[i].firstarc=NULL;
}
for (i=0;i<G.vexnum;i++){
G.vertices[i].InDegree=0;
G.vertices[i].OutDegree=0;
}
for(i=0;i<G.arcnum;i++)
{
printf(“请输入第%d条边的起始顶点和终止顶点的下标(用逗号隔开)”,i+1);
fflush(stdin);
scanf("%d,%d",&j,&k);
G.vertices[k].InDegree++;
G.vertices[j].OutDegree++;
s=(ARCNODE *)malloc(sizeof(ARCNODE));
s->adjvex=k;
s->next=G.vertices[j].firstarc;
G.vertices[j].firstarc=s;
}
return G;
}
typedef struct StackNode
{
SElemType data;
struct StackNode *next;
} StackNode,*LinkStack;
Status InitStack(LinkStack &S)
{ // 构造一个带头结点的空栈S
S=(LinkStack)malloc(sizeof(StackNode));
S->next=NULL;
return OK;
}
int StackEmpty(LinkStack S)
{ // 判断栈是否为空栈
return S->nextNULL;
}
Status Push(LinkStack &S,SElemType e)
{ // 插入元素e为新的栈顶元素
LinkStack p;
p=(LinkStack)malloc(sizeof(StackNode));
p->data=e;
p->next=S->next;
S->next=p;
return OK;
}
Status Pop(LinkStack S){
SElemType x;
LinkStack p;
p=S->next;
if(StackEmpty(S))return ERROR;
x=p->data;
S->next=p->next;
free§;
return x;
}
void PrintStack(LinkStack S)
{ // 从栈底到栈顶依次对栈中每个元素调用函数visit()。
// 一旦visit()失败，则操作失败
SElemType x;
while(S->next!=NULL)
{
x=Pop(S);
printf("%d",x);
}
}
int TopologicalSort(ALGRAPH G)
{
int i,j,count=0;
LinkStack S;
InitStack(S);
ARCNODE *p;
for (i=0;i<G.vexnum;i++)
if(G.vertices[i].InDegree0)
Push(S,i);
while(!StackEmpty(S)){
i=Pop(S);
printf("%3c",G.vertices[i].data);
count++;
for (p=G.vertices[i].firstarc;p;p=p->next)
{
j=p->adjvex;
if(!(–G.vertices[j].InDegree))
Push(S,j);
}

}
if(count<G.vexnum)
	return FALSE;
else
    return OK;

}
int main()
{
ALGRAPH G;
G=creat_graph();
printf(“该图的拓扑有序序列:\n”);
TopologicalSort(G);
return 0;
}