然后，利用装配知识判定子装配体的装配优先约束关系，提高由装配结构树生成装配工艺APS树的效率。
Then, the preferential constraint relation of sub-assembly is judged by matching assembly knowledge. The algorithm efficiency of generating assembly process APS-tree is improved.
定义了树节点类来动态地反映节点间的链接关系，采用深度优先算法，快速识别网络拓扑结构的变化。
The Type of tree node is defined to show the link relation between nodes, and the depth-first strategy is employed to identify topology structure.
该实现算法以QC树的结构为基础，结合深度优先算法和等价类的覆盖关系对QC树进行维护和查询。
The implementation maintains and queries QC-tree based on the structure of QC-tree, combining the deep first algorithm and cover of equivalent classes.
该实现算法以QC树的结构为基础，结合深度优先算法和等价类的覆盖关系对QC树进行维护和查询。
The implementation maintains and queries QC-tree based on the structure of QC-tree, combining the deep first algorithm and cover of equivalent classes.
应用推荐