LAOV网络及其拓扑排序算法  

The LAOV Network and Its Topological Sorting Algorithm

作　　者：王文霞[1] 

机构地区：[1]运城学院,山西运城044000

出　　处：《廊坊师范学院学报（自然科学版）》2014年第2期31-33,共3页Journal of Langfang Normal University(Natural Science Edition)

摘　　要：基于AOV网络扑拓排序算法,提出了新的LAOV网络算法,并在VC++环境下利用栈和队列实现了LAOV网络拓扑排序算法,同时给出了在LAOV网络中拓扑排序里有无回路的判定方法,并举例说明了LAOV网络算法的执行过程、结果及运行时间等。实验分析结果表明,算法正确,效率较高。On the basis of AOV network topological sorting algorithm, the present paper puts forward a new LAOV network which achieved LAOV network topological sorting algorithm using stack and queue in VC ＋ ＋ environment. And besides, the new network proposes a decision method that can judge whether the topological sorting has circuits. Lastly, examples are illustrated to explain the implementation process, results, operating time and so on. The analysis of the experimental results shows that the algorithm is correct and more efficient.

关 键 词：AOV网络 期次 LAOV网络 拓扑排序 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]