| 一个新的拓扑排序算法及其理论和实际意义 |
| |
| 引用本文： | 黄铁军.一个新的拓扑排序算法及其理论和实际意义[J].微机发展,1993(4). |
| |
| 作者姓名： | 黄铁军 |
| |
| 作者单位： | 武汉工业大学自动化系 湖北武昌 |
| |
| 摘 要： | 本文提出一种新的拓扑排序算法,在保持时空复杂度最优的情况下给出了更好的结果。本文对它进行了详细分析,并简要指出了其理论和实际意义。
|
| 关 键 词： | 拓扑排序 AOV网 时空复杂度 |
A New Topological Sort Algorithm and It s Value in Theory and Practice |
| |
| HUANG Tie Jun.A New Topological Sort Algorithm and It s Value in Theory and Practice[J].Microcomputer Development,1993(4). |
| |
| Authors: | HUANG Tie Jun |
| |
| Affiliation: | HUANG Tie Jun |
| |
| Abstract: | I T'his paper gave a new lopological sort algorithm which gives better results than traditional algorithm with optimal time and space complexity. The author analysised it perfectly and compared it with the traditional algorithm. At last, introduced it's value in theory and peactice. |
| |
| Keywords: | Topological Sort AOV-Network( Activity On Vertex Network ) :Time Complexity and Space Complexity |
| 本文献已被 CNKI 等数据库收录！ |
