基于二叉树的故障树画树算法研究  

Research of Fault Tree Drawing Method Based on Bifork Tree

作　　者：刘福君[1] 李华[1] 王玉森[1] 李国华[1] 张武[1] 

机构地区：[1]第二炮兵装备研究院,北京100085

出　　处：《计算机技术与发展》2006年第7期117-118,164,共3页Computer Technology and Development

摘　　要：由于在故障树分析、故障诊断和可靠性分析中迫切要求故障树图形化显示,所以文中研究了故障树画树算法。故障树显示为多叉树,将故障树节点的下一级节点作为左节点,将故障树同级右侧节点作为右节点,就把多叉树转换为二叉树存于数据库中,需要显示时将故障树节点信息对应的存于多向链表中的节点,通过递归函数计算出每个节点的坐标位置,然后用画树函数将故障树画于图形显示区域。文中基于C++Builder 6.0开发环境,实现了故障树的图形显示,这样就为基于故障树的故障诊断提供坚实基础。Because fault tree analysis, fault diagnosis and reliability analysis require that the fault tree can be showed, so the algorithm of drawing fault tree was researched by this article. The distinguishing feature of fault tree is introduced. The method of transforming of multifork tree to bifork tree is researched, and a new drawing fault tree algorithm by using bifork tree data structure is designed. At last, using C ＋ ＋ Builder 6.0 development environment, the fault tree graph is displayed.

关 键 词：故障树 多叉树 二叉树 

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