一种Hasse图的快速构造方法  

A Fast Construction Method for Hasse Diagram

作　　者：陈庆利[1,2] 门涛[1,2] 黄果[1,2] 秦洪英[1,2] 姜伟 伍宗元 Chen Qingli;Men Tao;Huang Guo;Qin Hongyin;Jiang Wei;Wu Zongyuan(College of Computer Science,Leshan Normal University,Leshan 614004,China;Sichuan Province University Key Laboratory of Internet Natural Language Intelligent Processing,Leshan Normal University,Leshan 614004,China)

机构地区：[1]乐山师范学院计算机科学学院,四川乐山614004 [2]乐山师范学院互联网自然语言智能处理四川省高等学校重点实验室,四川乐山614004

出　　处：《宁夏大学学报（自然科学版）》2020年第2期119-121,125,共4页Journal of Ningxia University(Natural Science Edition)

基　　金：四川省科技厅基金资助项目(2016ZY0238);四川省教育厅基金资助项目(18ZB0266,18ZA0235);互联网自然语言智能处理四川省高校重点实验室项目(INLP201902)。

摘　　要：为了改善传统Hasse图构造方法复杂的问题,根据Hasse图的分层特征、同层间元素无关系、相邻层可能满足关系的性质,提出一种快速、高效的Hasse图构造方法.首先根据两个规则对集合元素进行分层处理,使元素分布于不同层,然后根据关系对相邻两层的元素进行连线处理,整理得到Hasse图,最后给出了该构造方法的算法实现.构造示例表明了该构造方法不仅有效,而且简单、高效.In order to reduce the complexity of the traditional Hasse diagram construction method,a fast and efficient construction method is proposed according to the fact that the elements of a set are divided into different vertical layers when Hasse diagram being constructed,and the any two elements at same layer have no relationship,and the elements at two adjacency layers may satisfy the relationship.First of all,according to two rules,all elements are divided into vertical layers,and this makes different elements at different levels,then the two elements at adjacent layers are connected together according to the relationship,then,the final Hasse diagram is gotten.Experimental results show the method is effective and it also show that this method is simple and efficient.

关 键 词：Hasse图 偏序关系 偏序集 关系图 算法 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构] O213[自动化与计算机技术—计算机科学与技术]