深度优先算法在创建树形结构中的应用研究

摘要

In order to make the software system can be flexible management of tree structure,modify the scheme to generate dynamic tree structure proposed by relevant scholars,give the data table autocorrelation method to store node information,put forward the definition in the storage state of the parent nodes,sibling nodes,leaf nodes. The use of depth first algorithm to extract the node information,and nodes are sorted according to the tree structure,based on the ranking results and spanning tree structure and node type,achieve a infinite order dynamic tree with good portability,extensibility and maintainability. Finally,put the dynamic tree into the school management system,the experiment results show after implantation of the tree structure,the system has the advantages of strong structural information interface, clear information layer and simple operation for user.%为了让软件系统可以对树结构进行灵活管理，对相关学者提出的生成动态树结构的方案进行改进，给出了以数据表自关联的方式对节点信息进行存储，提出了在存储状态下的父节点、兄弟节点、叶子节点等节点类型的定义。使用深度优先非递归算法抽取节点信息，并按照树结构方式对节点进行排序，依据排序结果以及节点类型生成树结构，实现了一种具有很好可移植性、可扩充性和可维护性的无限级动态树。最后，将动态树植入学校管理系统，通过实验证明，植入该树结构之后系统具有界面结构性强、信息层次清晰、用户操作简单等优点。