A method for locating family member nodes based on family graph

Abstract

The present invention discloses a family member node positioning method based on a family graph, belonging to the field of node positioning technology. The specific steps of the positioning method are as follows: (1) defining family member node rules; (2) detecting and hiding irrelevant nodes; (3) calculating the positions of each group of family member nodes; (4) checking and connecting family member nodes. The present invention can make the family member node positioning system more convenient to operate, and users can quickly get started. At the same time, the predictability of node positions increases the user's sense of control, and the process of building a tree is more standardized and simplified. When users have their own special needs, there is no need to re-customize the style, and it can be easily adjusted according to the needs.

Description

Technical Field

[0001] The present invention relates to the technical field of node positioning, and in particular to a family member node positioning method based on a family graph. Background Art

[0002] Bootstrap includes a responsive, mobile-first, non-fixed grid system that can be appropriately expanded to 12 columns as the device or viewport size increases. It includes predefined classes for simple layout options, as well as powerful hybrid classes for generating more semantic layouts. Page layouts are created through a series of row and column combinations. In the family tree, the position of the tree is standardized by defining a "grid system". The Bootstrap framework is an effective tool for organizing web content. In the Bootstrap grid system, the web window is divided into several columns of equal width. Developers can refer only to the number of columns without specifying the exact width of the content, making the grid system more simplified;

[0003] The existing family member node positioning method based on family map has a high learning cost. Before using the Bootstrap system, you need to understand the entire framework and read the framework's documentation. When users have their own special needs, they need to re-customize the style. If a website has a large number of non-Bootstrap "style" styles, they also need to be rewritten, so the meaning of using the framework is lost. For this reason, we propose a family member node positioning method based on family map. Summary of the invention

[0004] The purpose of the present invention is to solve the defects in the prior art and to propose a method for locating family member nodes based on a family graph.

[0005] In order to achieve the above object, the present invention adopts the following technical solutions:

[0006] A method for locating family member nodes based on a family graph, the specific steps of the locating method are as follows:

[0007] (1) Define family member node rules;

[0008] (2) Detect and hide irrelevant nodes;

[0009] (3) Calculate the node positions of each group of family members;

[0010] (4) Check and connect family member nodes.

[0011] 2. A method for locating family member nodes based on a family graph according to claim 1, characterized in that the specific steps of defining node rules in step (1) are as follows:

[0012] Step 1: Lay out the node tree in a curved shape, distribute each group of nodes along each arc, and define a grid system in the positioning of each node;

[0013] Step 2: Set the base level to 0. When a young generation node is added to the tree, the levels of all old member nodes will be updated by one. Then, in each level, the unit of node distance is defined as a fixed angle, and the position of each node is calculated.

[0014] 3. A method for locating family member nodes based on a family map according to claim 2, characterized in that the specific calculation formula for the node position in step 2 is as follows:

[0015]

[0016]

[0017] Where svgWidth represents the width of the SVG block, levellenth represents the distance between the level circles of the generations, and angle represents the angle of the node in the coordinates.

[0018] 4. A method for locating family member nodes based on a family graph according to claim 3, characterized in that the specific steps of hiding irrelevant nodes in step (2) are as follows:

[0019] Step 1: After the node rule is defined, the grid system iteratively searches all indirect child nodes in the node tree and iteratively hides all non-related member nodes;

[0020] Step 2: Then build a set of do-while loop functions, and use the loop functions to check the length of the hidden member nodes, and at the same time detect whether each group of member nodes in the single-chain node has been checked;

[0021] Step 3: If the single-chain node has a check mark, it is determined that each group member node in the single-chain node has been checked. If the single-chain node does not have a check mark, it is determined that each group member node in the single-chain node has not been checked, and the grid system checks the single-chain node at the same time.

[0022] 5. A method for locating family member nodes based on a family graph according to claim 4, characterized in that the specific steps for calculating the member node position in step (3) are as follows:

[0023] S1.1: The network system determines the positions of all member nodes in the node tree, and identifies and checks four relationships on each member node, wherein the four relationships specifically include parent-child relationship, child-parent relationship, partnership relationship, and sibling relationship;

[0024] S1.2: At the same time, in the parent-child relationship, when a child node is a direct child node, only the position of the child node is defined, and then the indirect child nodes are defined in the sibling relationship;

[0025] S1.3: In the sibling relationship, recursively check the position of each node and the relationship between each other. After checking all member nodes, calculate the position of each node using formula (1) and formula (2), and position all indirect child nodes according to the direct child nodes.

[0026] 6. A method for locating family member nodes based on a family graph according to claim 5, characterized in that the specific steps of checking the connection of the nodes in step (4) are as follows:

[0027] S2.1: The grid system checks the distance between any two groups of member nodes in the node tree. If the distance between the two groups of nodes is less than the minimum value defined in the level, the two groups of member nodes are considered to be in conflict and are regarded as conflict pairs;

[0028] S2.2: The grid system will calculate and hide the previously added member nodes and their own related member nodes, and then repeat the drawing process again until no conflict is detected;

[0029] S2.3: Draw all static and additional elements, and connect the member nodes of each relationship according to the connection rules. After the member nodes are connected, the pairing arc will check all the pairs and connect them with an arc path;

[0030] S2.4: At the same time, the sibling arc will traverse all the child elements of the parent element and connect them by drawing an arc between the first and last child element nodes.

[0031] Compared with the prior art, the present invention has the following beneficial effects:

[0032] Compared with the previous node positioning methods, the family member node positioning method based on the family map layouts the node tree in a curved shape, distributes each group of nodes along each arc, and defines a grid system in the positioning of each node. Then, the basic level of each node is set to 0. When a young generation node is added to the tree, the level of all old member nodes will be updated by one. After the node rule definition is completed, the grid system iteratively searches all non-direct child nodes in the node tree and iteratively hides all non-related member nodes. The network system determines the location of all member nodes in the node tree and identifies and checks on each member node. Four relationships, then calculate the position of each member node, detect whether there is a conflict in each node tree, if the distance between the two groups of nodes is less than the minimum value defined in the level, then the grid system will calculate and hide the previously added member nodes and their own related member nodes, and then repeat the drawing process again until no conflict is detected, and connect the member nodes, which can make the family member node positioning system more convenient to operate, and users can quickly get started. At the same time, the predictability of node positions increases the user's sense of control, and the process of building the tree is more standardized and simplified. When users have their own special needs, there is no need to redefine the style, and it can be easily adjusted according to needs. BRIEF DESCRIPTION OF THE DRAWINGS

[0033] The accompanying drawings are used to provide further understanding of the present invention and constitute a part of the specification. They are used to explain the present invention together with the embodiments of the present invention and do not constitute a limitation of the present invention.

[0034] Figure 1 This is a flowchart of a family member node positioning method based on a family graph proposed by the present invention. DETAILED DESCRIPTION

[0035] Reference Figure 1 , a method for locating family member nodes based on a family graph, the specific steps of the locating method are as follows:

[0036] Define family member node rules.

[0037] Specifically, the computer system lays out the node tree in a curved shape, distributes each group of nodes along each arc, and defines a grid system in the positioning of each node. The basic level of each node is then set to 0. When a young generation node is added to the tree, the levels of all old member nodes will be updated by one. Then, in each level, the unit of node distance is defined as a fixed angle, and the position of each node is calculated.

[0038] It should be further explained that the specific calculation formula for the node position is as follows:

[0039]

[0040]

[0041] Where svgWidth represents the width of the SVG block, levellenth represents the distance between the level circles of the generations, and angle represents the angle of the node in the coordinates.

[0042] Detect and hide irrelevant nodes.

[0043] Specifically, after the node rule definition is completed, the grid system iteratively searches all non-direct child nodes in the node tree and iteratively hides all non-related member nodes, then constructs a set of do-while loop functions, and uses the loop functions to check the length of the hidden member nodes, and at the same time detects whether each group of member nodes in the single-chain node has been checked. If the single-chain node has a check mark, it is determined that each group of member nodes in the single-chain node has been checked. If the single-chain node does not have a check mark, it is determined that each group of member nodes in the single-chain node has not been checked, and the grid system checks the single-chain node at the same time.

[0044] Calculate the node positions of each group of family members.

[0045] Specifically, the network system determines the positions of all member nodes in the node tree, and identifies and checks four relationships on each member node, wherein the four relationships specifically include parent-child relationship, child-parent relationship, partnership relationship, and sibling relationship. Meanwhile, in the parent-child relationship, when a child node is a direct child node, only the position of the child node is defined, and then the indirect child node is defined in the sibling relationship. In the sibling relationship, the position of each node and the relationship between each other are recursively checked. After all member nodes are checked, the position of each node is calculated by formula (1) and formula (2), and all indirect child nodes are located according to the direct child nodes.

[0046] Check and connect family member nodes.

[0047] Specifically, the grid system checks the distance between any two groups of member nodes in the node tree. If the distance between the two groups of nodes is less than the minimum value defined in the level, the two groups of member nodes are considered to be in conflict and are regarded as conflict pairs. The grid system then calculates and hides the previously added member nodes and their own related member nodes, and then repeats the drawing process until no conflict is detected. All static and attached elements are then drawn, and the member nodes of each relationship are connected according to the connection rules. After the member nodes are connected, the pairing arc checks all pairings and connects them with an arc path. At the same time, the sibling arc traverses all child elements of the parent element and connects them by drawing an arc between the first and last child element nodes.

[0048] It should be further explained that this grid system introduces a mechanism of base shifting, where any node can be moved to the bottom of the tree, so those that were originally hidden can be shown again when their immediate relatives are moved to the base. At the same time, to ensure that the tree is positioned straight, the bottom of the tree will always be drawn based on the base node or pair node on level 0. Since the child nodes on level 0 are always calculated first, every node built on them will have the correct structure.

Claims

1. A method for locating family member nodes based on a family graph, characterized in that: The specific steps of this positioning method are as follows: (1) Define family member node rules; (2) Detect and hide irrelevant nodes; (3) Calculate the node positions of each group of family members; (4) Check and connect family member nodes; The specific steps for defining node rules in step (1) are as follows: Step 1: Layout the node tree in a curved shape, distribute each group of nodes along each arc, and define a grid system in the positioning of each node; Step 2: Set the base level to 0. When a young generation node is added to the tree, the levels of all old member nodes will be updated by one. Then, in each level, the unit of node distance is defined as a fixed angle, and the position of each node is calculated at the same time. The specific steps for calculating the member node position in step (3) are as follows: S1.1: The network system determines the positions of all member nodes in the node tree, and identifies and checks four relationships on each member node, wherein the four relationships specifically include parent-child relationship, child-parent relationship, partnership relationship, and sibling relationship; S1.2: At the same time, in the parent-child relationship, when a child node is a direct child node, only the position of the child node is defined, and then the indirect child nodes are defined in the sibling relationship; S1.3: In the sibling relationship, recursively check the position of each node and the relationship between each other. After checking all member nodes, calculate the position of each node using formula (1) and formula (2), and locate all indirect child nodes according to the direct child nodes; The specific steps of node checking connection in step (4) are as follows: S2.1: The grid system checks the distance between any two groups of member nodes in the node tree. If the distance between the two groups of nodes is less than the minimum value defined in the level, the two groups of member nodes are considered to be in conflict and are regarded as conflict pairs; S2.2: The grid system will calculate and hide the previously added member nodes and their own related member nodes, and then repeat the drawing process again until no conflict is detected; S2.3: Draw all static and additional elements, and connect the member nodes of each relationship according to the connection rules. After the member nodes are connected, the pairing arc will check all the pairs and connect them with an arc path; S2.4: At the same time, the sibling arc will traverse all the child elements of the parent element and connect them by drawing an arc between the first and last child element nodes.

2. A method for locating family member nodes based on a family graph according to claim 1, characterized in that: The specific calculation formula for the node position in step 2 is as follows: （1） （2） In the formula, Represents the width of the SVG block, Represents the distance between generational hierarchical circles, Represents the angle of the node in coordinates.

3. A method for locating family member nodes based on a family graph according to claim 1, characterized in that: The specific steps of hiding irrelevant nodes in step (2) are as follows: Step 1: After the node rule is defined, the grid system iteratively searches all indirect child nodes in the node tree and iteratively hides all non-related member nodes; Step 2: Then build a set of do-while loop functions, and use the loop functions to check the length of the hidden member nodes, and at the same time detect whether each group of member nodes in the single-chain node has been checked; Step 3: If the single-chain node has a check mark, it is determined that each group member node in the single-chain node has been checked. If the single-chain node does not have a check mark, it is determined that each group member node in the single-chain node has not been checked, and the grid system checks the single-chain node at the same time.

Images