| 求可达矩阵的Warshall算法 |
| |
| 引用本文： | 王秋萍 梁戈. 求可达矩阵的Warshall算法[J]. 西安理工大学学报, 1996, 12(1): 80-82 |
| |
| 作者姓名： | 王秋萍 梁戈 |
| |
| 作者单位： | 西安理工大学理学院应用数学系 |
| |
| 摘 要： | 给出并证明了确定内部独立的递阶层次结构的矩阵方法。将系统用有向图描述，利用集合论中求关系问包的Ｗａｒｓｈａｌｌ算法实现了求可达矩阵。在决策因素很多且问题很复杂时，可以通过有向图的可达矩阵来确定系统的层次结构。
|
| 关 键 词： | 递阶层次结构，可达矩阵，Warshall算法 |
The Warshall Algorithm for Computing Reachability Matrix |
| |
| Wang Qiuping,Liang Ge. The Warshall Algorithm for Computing Reachability Matrix[J]. Journal of Xi'an University of Technology, 1996, 12(1): 80-82 |
| |
| Authors: | Wang Qiuping Liang Ge |
| |
| Abstract: | The method of constructing hierarchical structure with inner independence isintroduced and proved.The system is described by directed graph. The reachability matrix ofdirected graph is computed by Warshall algorithm for computing transitive closure of relationshipin set theory.When decision-making problem is complex and there are many decision-makingfactors,hierarchical structure may be constructed by the reachability matrix of directed graph. |
| |
| Keywords: | hierarchical structure reachability matrix Warshall algorithm |
| 本文献已被 CNKI 维普 等数据库收录！ |
