6-13 Topological Sort(25 分)
Write a program to find the topological order in a digraph.
Format of functions:
bool TopSort( LGraph Graph, Vertex TopOrder[] );
where LGraph
is defined as the following:
typedef struct AdjVNode *PtrToAdjVNode;
struct AdjVNode{
Vertex AdjV;
PtrToAdjVNode Next;
};
typedef struct Vnode{
PtrToAdjVNode FirstEdge;
} AdjList[MaxVertexNum];
typedef struct GNode *PtrToGNode;
struct GNode{
int Nv;
int Ne;
AdjList G;
};
typedef PtrToGNode LGraph;
The topological order is supposed to be stored in TopOrder[]
where TopOrder[i]
is the i
-th vertex in the resulting sequence. The topological sort cannot be successful if there is a cycle in the graph -- in that caseTopSort
must return false
; otherwise return true
.
Notice that the topological order might not be unique, but the judge's input guarantees the uniqueness of the result.
Sample program of judge:
#include <stdio.h>
#include <stdlib.h>
typedef enum {false, true} bool;
#define MaxVertexNum 10 /* maximum number of vertices */
typedef int Vertex; /* vertices are numbered from 0 to MaxVertexNum-1 */
typedef struct AdjVNode *PtrToAdjVNode;
struct AdjVNode{
Vertex AdjV;
PtrToAdjVNode Next;
};
typedef struct Vnode{
PtrToAdjVNode FirstEdge;
} AdjList[MaxVertexNum];
typedef struct GNode *PtrToGNode;
struct GNode{
int Nv;
int Ne;
AdjList G;
};
typedef PtrToGNode LGraph;
LGraph ReadG(); /* details omitted */
bool TopSort( LGraph Graph, Vertex TopOrder[] );
int main()
{
int i;
Vertex TopOrder[MaxVertexNum];
LGraph G = ReadG();
if ( TopSort(G, TopOrder)==true )
for ( i=0; i<G->Nv; i++ )
printf("%d ", TopOrder[i]);
else
printf("ERROR");
printf("\n");
return 0;
}
/* Your function will be put here */
Sample Input 1 (for the graph shown in the figure):
5 7
1 0
4 3
2 1
2 0
3 2
4 1
4 2
Sample Output 1:
4 3 2 1 0
Sample Input 2 (for the graph shown in the figure):
5 8
0 3
1 0
4 3
2 1
2 0
3 2
4 1
4 2
Sample Output 2:
ERROR
拓扑排序(队列):
bool TopSort(LGraph Graph, Vertex TopOrder[])
{Vertex Degree[MaxVertexNum] = { 0 };
PtrToAdjVNode Ptr;
Vertex Queue[MaxVertexNum] = { 0 };
int Front=0, Rear=0;
for (int i = 0; i < Graph->Nv; i++) {
Ptr = Graph->G[i].FirstEdge;
for (; Ptr != NULL; Ptr = Ptr->Next)
Degree[Ptr->AdjV]++;
}
for(int i=0;i<Graph->Nv;i++)
if (Degree[i] == 0)
Queue[Rear++] = i;
while (Front < Rear) {
Vertex V = Queue[Front++];
TopOrder[Front - 1] = V;
Ptr = Graph->G[V].FirstEdge;
for (; Ptr != NULL; Ptr = Ptr->Next) {
Degree[Ptr->AdjV]--;
if (Degree[Ptr->AdjV] == 0)
Queue[Rear++] = Ptr->AdjV;
}
}
if (Front < Graph->Nv)
return false;
return true;
}