Method for dynamically adjusting tree spacing based on Walker's Tree

Abstract

The invention discloses a method for dynamically adjusting tree spacing based on Walker's Tree, and relates to the field of automatic mapping of structural trees. The Walker's Tree algorithm effectively solves the two problems that the width of a drawing tree is very wide and a father node in the tree is not the central position of all child nodes of the father node, and the unique defect is thatthe distance in the tree is not dynamically adjusted. The method comprises the following steps of: 1) processing data topology information; 2) establishing a tree structure model; 3) performing subsequent traversal on all nodes in the tree model, and calculating an initial value and an adjustment value of each node coordinate in the tree; 4) carrying out preorder traversal, and calculating final coordinates of each node in the tree; and 5) outputting the graph of the tree. According to the method, the symmetry of the father nodes relative to the child nodes is guaranteed, it is also guaranteedthat the distance between tree structures can be dynamically adjusted according to the sizes of the nodes, the requirements that the sizes of the nodes in the tree are different, the structure of thetree is not crowded, and the whole tree graph is orderly can be met, and perfect tree graph output is achieved.

Description

technical field [0001] The invention relates to the field of automatic graphing of structured trees, in particular to a method for dynamically adjusting tree spacing based on Walker's Tree. Background technique [0002] The key task in drawing a tree is to determine the position of each node in the tree. The tree drawing algorithm mainly calculates the x and y coordinates of each node of the tree. These coordinates can then be used to draw the tree. Among them, the node localization algorithm must solve two key problems. First, paint the overall aesthetic of the tree. Second, the node localization algorithm should save space. Each of these two problems can be tackled directly, but combining them poses some challenges. [0003] The algorithms for drawing trees proposed by many researchers also have unsatisfactory results. There are three main problems to be solved, namely 1) the width of the drawn tree is very wide; 2) the parent node in the tree is not The center posit...

AI Technical Summary

Problems solved by technology

[0003] The algorithms for drawing trees proposed by many researchers also have unsatisfactory results. There are three main problems to be solved, namely 1) the width of the drawn tree is very wide; 2) the parent node in the tree is not The center position of all its child nodes; 3) The spacing of each layer in the tree is fixed, which is a fixed constant. This setting does not consider the impact between the size and spacing of the upper and lower layers of nodes

[0004] The Walker’s Tree algorithm effectively solves the first two problems. The only shortcoming is that it does not take into account the dynamic adjustment of the spacing in the tree, so that the overall tree structure is beautiful and the hierarchical structure of the tree will not be very high and abrupt.

Images