摘要
对 AOV网的不同存储结构的拓朴排序 ,在传统算法的基础上提出了新的改进算法 ,并对这些算法的时间、空间复杂性进行了分析和比较 。
On the basis of traditional algorithm, a new improved algorithm for topological sorting on different storage structure of AOV net was put forward.Time consumed and space complexity as well as the suitable ranges of these different algorithms were also analysed and compared.
出处
《西北大学学报(自然科学版)》
CAS
CSCD
北大核心
2002年第4期344-346,354,共4页
Journal of Northwest University(Natural Science Edition)
基金
陕西省自然科学基金资助项目 (2 0 0 0 SL0 5 )