基于树的AOV网并行性全拓扑排序算法设计与实现  

The Design and Realization of Overall-Topological Sorting Algorithm for the Parallel Tree-based AOV-net

作　　者：李俐玲[1] 姜玉苹[1] 

机构地区：[1]绵阳师范学院数学与信息科学系,四川绵阳621000

出　　处：《绵阳师范学院学报》2007年第5期116-121,共6页Journal of Mianyang Teachers＇ College

摘　　要：讨论了AOV网的一种并行性全拓扑排序的算法及实现,解决了传统拓扑排序算法的单一性问题,说明了并行全拓扑排序有重要的实用价值。The design and the implementation of a parallel and overall - topological sorting algorithm have been discussed ; the singularity of the traditional topological sorting algorithm has been avoided, which shows that the parallel and overall - topological sort is of great importance and value in practice.

关 键 词：AOV网 并行性全拓扑排序 拓扑树 

分 类 号：TP311.12[自动化与计算机技术—计算机软件与理论]