Topological Sort

最新推荐文章于 2024-03-03 21:39:31 发布

原创

最新推荐文章于 2024-03-03 21:39:31 发布 · 1.1k 阅读

0 ·

CC 4.0 BY-SA版权

编写一个程序，对有向图进行拓扑排序。程序应处理函数格式，并在存在环的情况下返回失败标志。输入样例保证了结果的唯一性。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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 case TopSort must return false; otherwise return true.

Notice that the topolog