摘要
给出了有向图在邻接表表示下具有局部并行性质的拓扑排序算法,该算法较其它的算法具有更好的实用性,而且在空间与时间的开销上并无多大的增加。用C++编写了源程序,并给出了运行结果。结果表明我们的算法是可行的。
We presented an algorithm of topological sorting with local collateral property for digraph expressed in adjacency lists in the present paper. Compared with other method, our algorithm has more practicability with little increase in the cost of running time and memory. The related source program and the running results were also provided. The results show that our algorithm is feasible.
出处
《咸阳师范学院学报》
2009年第2期55-57,共3页
Journal of Xianyang Normal University
关键词
有向图
拓扑排序
邻接表.
digraph
topological sort
adjacency lists
