拓扑排序算法的拓展研究

Extension Research on Topological Sort

拓扑排序是有向图的一种重要运算,可以根据拓扑序列串行地安排活动。为增加活动安排的并行性,文章提出并实现了分阶段拓扑排序算法。为求出最佳拓扑序列,还提出了一种全拓扑排序的实现算法。

The topological sort is an important operation of directed graphs.We can make plan of project according to topological sequence.For more parallel,this paper proposes and implements topological sort algorithm by stages.For optimum topological sequence,this paper presents an algorithm to get all topological sequence.