The B-tree is a generalization of a binary search tree in that a node can have more than two children.
树是二叉搜索树的泛化，其节点可以具有多于两个的子节点。
By the B-cut sets and the probabilities of the nodes of Binary Decision Diagrams (BDD), a new quantitative analysis algorithm of coherent fault tree based on BDD is presented in this paper.
利用二元决策图(BDD)中的B—割集和节点概率，提出了基于BDD的关联故障树定量分析新算法。
By the B-cut sets and the probabilities of the nodes of Binary Decision Diagrams (BDD), a new quantitative analysis algorithm of coherent fault tree based on BDD is presented in this paper.
利用二元决策图(BDD)中的B—割集和节点概率，提出了基于BDD的关联故障树定量分析新算法。
应用推荐