摘要
给出并证明了确定内部独立的递阶层次结构的矩阵方法。将系统用有向图描述，利用集合论中求关系问包的Ｗａｒｓｈａｌｌ算法实现了求可达矩阵。在决策因素很多且问题很复杂时，可以通过有向图的可达矩阵来确定系统的层次结构。
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.
出处
《西安理工大学学报》
CAS
1996年第1期80-82,共3页
Journal of Xi'an University of Technology
关键词
递阶层次结构
可达矩阵
矩阵
W-算法
hierarchical structure
reachability matrix
Warshall algorithm
