物料清单构造中嵌套检查改进算法  

Improved algorithm in checking overlaped nest problem in Bill Of Material construction

作　　者：方霞[1] 潘梅森[1] 

机构地区：[1]湖南文理学院计算机科学与技术学院,湖南常德415000

出　　处：《计算机工程与应用》2008年第36期209-211,共3页Computer Engineering and Applications

基　　金：湖南省自然科学基金(No.07JJ6141)~~

摘　　要：结合物料清单(BOM)递归遍历、非递归遍历和层次遍历方法,针对多层次通用件的广泛适用构成的复杂产品,将实用性较强的网状BOM构造方法和无向无环图(DAG)的基本理论相融合,提出了一种新的BOM嵌套检查及合法性检查改进算法。该算法采用自顶向下方式逐层分解,设计不同的标志位及迭代来决定当前操作对象,充分利用关系数据库的操作特点,不受内存限制,具有较高的执行效率。With the recursive traversal,non-recursion traversal and level traversal methods of BOM（Bi11 Of Material） and its wide use of multi-level generic pieces and complex structure,this paper proposed an improved algorithm checking the overlaped nest and the legitimacy,which integrated the basic theory of DAG （Directed Acyclic Graph） chart and the practical net structure of BOM.This paper used the idea of top-down and layers decomposition,designed different signs and iteration to determine the cur- rent operation target,maked full use of the operation features in relational database,freed from memory constraints,the algorithm has a higher efficiency in implementation.

关 键 词：物料清单 遍历方法 嵌套检查 多层次通用件 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]