Abstract The topological sort is an important operation of directed graph s.Th is paper p resents a linear algorithm to obtain a more reasonable topological sorting in the directed acyclic graph.

• 摘要: 摘 要 拓扑排序是有向图的一种重要运算.；用一种线性的算法得到有向无圈图的一个更趋 于合理的拓扑序列