CN114913267A

CN114913267A - Brain graph drawing method, device, equipment and storage medium

Info

Publication number: CN114913267A
Application number: CN202210565280.5A
Authority: CN
Inventors: 汪小益; 邱炜伟; 王艳; 尚璇; 胡麦芳
Original assignee: Hangzhou Qulian Technology Co Ltd
Current assignee: Hangzhou Qulian Technology Co Ltd
Priority date: 2022-05-23
Filing date: 2022-05-23
Publication date: 2022-08-16

Abstract

The application discloses a brain graph drawing method, a brain graph drawing device, brain graph drawing equipment and a storage medium, and belongs to the technical field of computers. The method comprises the following steps: acquiring target data, wherein the target data comprises n levels of nodes, the sequence of the nodes from the 1 st level to the nth level in the n levels is the sequence from a root node to a leaf node, and n is an integer greater than or equal to 2; generating a data card of each node in the n levels of nodes, wherein the data card comprises a control for displaying and editing data elements of the nodes; displaying the data card of each node in the n levels of nodes on the brain graph page according to the sequencing relation among the n levels of nodes; and drawing connecting lines among the data cards of all nodes displayed in the brain graph page according to the parent-child relationship among the nodes of the n layers. Therefore, for technicians, the technologies used in brain mapping are all front-end basic technologies, and other frames do not need to be learned, so that the realization is simple.

Description

Brain graph drawing method, device, equipment and storage medium

Technical Field

The present application relates to the field of computer technologies, and in particular, to a method, an apparatus, a device, and a storage medium for brain map rendering.

Background

When data is displayed on the Web (World Wide Web) side, the data is usually displayed on a Web page in a table form, however, the table cannot clearly express the source of the data and the flow direction of the data. The problem is solved by the appearance of a brain graph (also called a mind graph), wherein the brain graph comprises the relationship among data, and the data is displayed on a web page in the form of the brain graph, so that a user can clearly see the source of the data and the flow direction of the data, and the user experience can be improved.

In the related art, brain mapping is realized by an AntV/G6 framework. The AntV/G6 framework encapsulates API (Application Program Interface) functions that can draw a brain graph. When the brain graph is drawn, the data of the tree structure to be displayed is used as a parameter of an API function for drawing the brain graph, and the API function is directly called, so that the brain graph corresponding to the data can be drawn in a web page.

However, the above-mentioned brain mapping method needs to call the API function in the AntV/G6 framework, which requires that the technician is familiar with the AntV/G6 framework, and the technician needs to spend a lot of effort to learn the AntV/G6 framework, so that the learning cost is high and the implementation difficulty is high.

Disclosure of Invention

The application provides a brain graph drawing method, a brain graph drawing device, brain graph drawing equipment and a storage medium, which can draw a brain graph of data at a lower learning cost and are simple to implement. The technical scheme is as follows:

in a first aspect, there is provided a method of brain mapping, the method comprising:

acquiring target data, wherein the target data comprises n levels of nodes, the sequence of the nodes from the 1 st level to the nth level in the n levels is the sequence from a root node to a leaf node, and n is an integer greater than or equal to 2;

generating a data card for each node in the n levels of nodes, wherein the data card comprises a control for displaying and editing data elements of the nodes;

displaying the data card of each node in the n levels of nodes on a brain graph page according to the sorting relation among the n levels of nodes;

and drawing connecting lines among the data cards of all nodes displayed in the brain graph page according to the parent-child relationship among the nodes of the n layers.

In the present application, target data is obtained, and the target data includes n levels of nodes. And then generating a data card of each node in the n levels of nodes. And then displaying the data card of each node in the n levels of nodes in the brain graph page according to the ordering relation among the n levels of nodes, and drawing connecting lines among the data cards of all the nodes displayed in the brain graph page according to the parent-child relation among the n levels of nodes. Because the data cards of each node are controls for displaying and editing the data elements of the corresponding node, each data card can be triggered in a targeted manner, that is, when a user clicks any one data card, the terminal can directly know which data card is clicked, so that the terminal can know that the corresponding interactive operation is to be performed on the node to which the data card belongs, and the interaction is friendly. Moreover, for technicians, all the technologies used in brain mapping are front-end basic technologies, and other frames do not need to be learned, so that the realization is simple.

In a second aspect, there is provided an electroencephalogram rendering apparatus, the apparatus comprising:

an obtaining module, configured to obtain target data, where the target data includes n levels of nodes, where a sequence of nodes from a 1 st level to an nth level in the n levels is a sequence from a root node to a leaf node, and n is an integer greater than or equal to 2;

a generating module, configured to generate a data card for each node in the n levels of nodes, where the data card includes a control for displaying and editing data elements of the node;

the first display module is used for displaying the data card of each node in the n levels of nodes on the brain graph page according to the sorting relation among the n levels of nodes;

and the drawing module is used for drawing the connecting lines among the data cards of all the nodes displayed in the brain graph page according to the parent-child relationship among the nodes of the n layers.

In a third aspect, a computer device is provided, the computer device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, the computer program, when executed by the processor, implementing the brain mapping method described above.

In a fourth aspect, a computer-readable storage medium is provided, which stores a computer program that, when executed by a processor, implements the brain mapping method described above.

In a fifth aspect, a computer program product is provided comprising instructions which, when run on a computer, cause the computer to perform the steps of the brain mapping method described above.

It can be understood that, for the beneficial effects of the second aspect, the third aspect, the fourth aspect and the fifth aspect, reference may be made to the relevant description in the first aspect, and details are not described herein again.

Drawings

In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.

Fig. 1 is a flowchart of a brain mapping method provided by an embodiment of the present application;

FIG. 2 is a schematic diagram of a data card provided in an embodiment of the present application;

FIG. 3 is a schematic diagram of a first method for determining a data area of a jth node in an ith hierarchy according to an embodiment of the present disclosure;

FIG. 4 is a schematic diagram of a second method for determining a data area of a jth node in an ith hierarchy according to an embodiment of the present disclosure;

FIG. 5 is a schematic diagram of a third example of determining a data area of a jth node in an ith hierarchy according to the present disclosure;

FIG. 6 is a schematic diagram of a method for determining a data area of a first node in an ith hierarchy according to an embodiment of the present application;

FIG. 7 is a schematic diagram of another embodiment of the present application for determining a data region of a first node in an ith hierarchy;

FIG. 8 is a schematic diagram of a fourth method for determining a data area of a jth node in an ith hierarchy according to an embodiment of the present disclosure;

FIG. 9 is a schematic diagram of a fifth embodiment of the present application for determining a data area of a jth node in an ith hierarchy;

FIG. 10 is a schematic diagram illustrating a method for determining a data area for each node in level 1 according to an embodiment of the present disclosure;

FIG. 11 is another illustrative diagram for determining the data regions for each node in level 1 provided by embodiments of the present application;

FIG. 12 is a schematic diagram of a connection line between data cards of two nodes according to an embodiment of the present disclosure;

fig. 13 is a schematic diagram of determining a connecting line end point corresponding to each of two nodes according to an embodiment of the present disclosure;

FIG. 14 is a schematic diagram of a connection line between data cards of two nodes according to an embodiment of the present application;

FIG. 15 is a schematic diagram of a connection line between data cards of two nodes according to an embodiment of the present application;

FIG. 16 is a flow chart of another brain mapping method provided by an embodiment of the present application;

FIG. 17 is a schematic illustration of an electroencephalogram page provided by an embodiment of the present application;

fig. 18 is a schematic structural diagram of an electroencephalogram rendering apparatus provided in an embodiment of the present application;

fig. 19 is a schematic structural diagram of a computer device according to an embodiment of the present application.

Detailed Description

To make the objects, technical solutions and advantages of the present application more clear, embodiments of the present application will be described in further detail below with reference to the accompanying drawings.

It should be understood that reference to "a plurality" in this application refers to two or more. In the description of the present application, "/" means "or" unless otherwise stated, for example, a/B may mean a or B; "and/or" herein is only an association relationship describing an associated object, and means that there may be three relationships, for example, a and/or B, which may mean: a exists alone, A and B exist simultaneously, and B exists alone. In addition, for the convenience of clearly describing the technical solutions of the present application, the terms "first", "second", and the like are used to distinguish the same items or similar items having substantially the same functions and actions. Those skilled in the art will appreciate that the terms "first," "second," etc. do not denote any order or quantity, nor do the terms "first," "second," etc. denote any order or importance.

Before explaining the embodiments of the present application in detail, an application scenario of the embodiments of the present application will be described.

One brain map drawing method in the related art is implemented by an AntV/G6 framework, but the AntV/G6 framework has no traceability function, so that a brain map drawn by using the AntV/G6 framework cannot perform traceability operation, that is, cannot view the source of certain data through the brain map drawn by the AntV/G6 framework.

Another brain graph drawing method in the related art is realized by canvas, which specifically includes the following steps: the method comprises the steps of regarding a web page as a canvas, setting a coordinate system by taking the upper left corner of the web page as the origin of the coordinate system, firstly determining a coordinate point of each node in the canvas in data of a tree structure to be displayed, then drawing each node on the canvas according to the coordinate point of each node, and then drawing a path between a parent node and a child node on the canvas according to the coordinate point of each node to realize brain graph drawing.

However, since the content on the web page is drawn in the manner of using canvas to implement brain mapping, the brain mapping presented on the web page is substantially a picture. Moreover, any operation performed in the web page depends on the coordinate system, so that when the interactive operation of a certain node is performed, if the click operation is detected on the web page, the coordinate point of the click position in the web page needs to be determined, then the coordinate point of the click position in the web page is compared with the coordinate point of each node to determine the node corresponding to the click position in the web page, and then the relationship between the node and other nodes can be determined. The brain graph drawing mode based on the coordinate system has strong dependency, the flow of interactive operation on the brain graph is complex, and the realization of complex interactive functions such as node addition is difficult. In addition, because the brain graph drawn in this way is substantially a single picture, the brain graph displayed in this way is relatively blurred when the screen resolution is relatively high because the brain graph is relatively dependent on the resolution.

Therefore, the brain map drawing method provided by the embodiment of the application can be applied to a scene for drawing a brain map, and particularly can be applied to a scene for displaying data in a form of the brain map on a page. Specifically, data to be displayed is acquired, wherein the data is data in a tree structure and comprises a plurality of levels of nodes. And then generating a data card of each node according to the nodes of the multiple layers, wherein the data card of each node is used for displaying the data elements of the corresponding node, displaying the data card of each node in a page, and drawing connecting lines among the data cards of each node in the page according to the parent-child relationship among the nodes to finish brain map drawing. The data cards of each node are controls for displaying and editing the data elements of the corresponding node, so that each data card can be triggered in a targeted manner, that is, when a user clicks any one data card, the terminal can directly know which data card is clicked, so that the terminal can know that the corresponding interactive operation is to be performed on the node to which the data card belongs, and the interaction is friendly. In addition, for technicians, the brain graph drawing method provided by the embodiment of the application adopts front-end basic technologies, and other frames do not need to be learned, so that the realization is simple.

The brain mapping method provided in the embodiments of the present application is explained in detail below.

Fig. 1 is a flowchart of a brain graph drawing method according to an embodiment of the present application. Referring to fig. 1, the method includes the following steps.

Step 101: the terminal acquires target data, wherein the target data comprises n levels of nodes.

The order of the nodes from the 1 st level to the nth level in the n levels is the order from the root node to the leaf node, and n is an integer greater than or equal to 2.

The target data is data which needs to be displayed in the form of a brain graph. Illustratively, the target data may be data designed by a technician on demand, and the target data may be obtained from a backend (including but not limited to a server). The structure of the target data is a tree structure, for example: the target data is a treeList (tree list).

For example, the target data is a tree list as shown in table 1 below, where table 1 includes nodes in 3 levels, and a node (initiator) in the first level is a parent node of two nodes (data preprocessing 1 and data preprocessing 2) in the second level and is also a root node of the entire tree list. The first node in the second hierarchy (data pre-processing 1) has two sub-nodes (feature engineering 1 and feature engineering 2), both of which are in the third hierarchy. The second node in the second hierarchy (data pre-processing 2) has two sub-nodes (feature engineering 3 and feature engineering 4), both of which are in the third hierarchy.

TABLE 1

In the embodiments of the present application, the target data is described only by taking table 1 as an example, and table 1 does not limit the embodiments of the present application.

Optionally, before acquiring the target data, the terminal may build a front end frame, for example, a React frame may be built, or an Vue frame may be built, which is not limited in this embodiment of the present application. In this way, the constructed front-end framework can be used for drawing a brain map of related data subsequently.

Optionally, after the terminal acquires the target data, a UI (User Interface) component may be selected to build a web page. For example, a web page may be built using components in the ANTD component library. Thus, the brain graph is convenient to draw in the constructed web page subsequently.

Step 102: the terminal generates a data card for each of the n levels of nodes, the data card including controls for displaying and editing data elements of the nodes.

The data card of each node in the n levels of nodes is used for displaying the data elements of the corresponding node. The control included in the data card refers to the packaging of data and methods, and the control can have own properties and methods, wherein the methods are some simple and visible functions of the control, and the control can be triggered. In the embodiment of the application, it is shown that the data card may be triggered, that is, the user may perform an operation on the data card in a targeted manner, for example, the user may directly click and select a certain data card.

Optionally, the control in the data card may implement functions of selecting a corresponding node, deleting a corresponding node, modifying a data element of a corresponding node, adding a new node, and the like. That is, the data elements of the nodes may be edited via controls in the data card.

Optionally, the mode of generating the data card of each node in the n levels of nodes by the terminal may be that a block-level element is defined by using a < div > tag in a tag library of HTML (Hyper Text Markup Language), and the data card of the corresponding node may be obtained by adding the data element of the corresponding node to the block-level element defined by using the < div > tag. In this case, the data card is the block level element defined using the < div > tag.

The < div > tag is used to define a partition or section in the HTML document. The < div > tag is often used to combine block-level elements in order to format them through a style sheet. The < div > tag may segment the document into separate, distinct portions. Therefore, the data cards of each node generated by the terminal are mutually independent, the format setting is simple, and the technical implementation is simple for technical personnel. For example, fig. 2 is a schematic diagram of the data card, as shown in fig. 2, fig. 2 includes a frame 201 of the data card, a data element 202 of a corresponding node, a delete button 203, and an add button 204, where the delete button 203 is used to trigger an operation of deleting the corresponding node, and the add button 204 is used to trigger an operation of adding a new sub-node of the corresponding node.

Step 103: and the terminal displays the data card of each node in the n levels of nodes on the brain graph page according to the sorting relation among the n levels of nodes.

The brain graph page may be a web page, and certainly, may also be other pages capable of implementing brain graph drawing, which is not limited in this embodiment of the application.

In this case, when the user clicks a certain data card displayed in the brain graph page during the interactive operation, since the data card can be triggered, the terminal can directly know which data card on the brain graph page the user clicks, and thus know which node the data card belongs to is to be correspondingly operated, so that the interactive operation is faster and more friendly.

Specifically, the operation of step 103 may be realized by the following steps (1) to (5).

(1) And the terminal determines n node areas corresponding to the n levels one by one in the brain graph page.

Each of the n node regions is used for displaying a data card of a node of a corresponding hierarchy. Therefore, the hierarchy of the whole brain graph page can be clearer. For example, each of the n node regions may be a rectangular region.

Alternatively, the operation of step (1) may be: determining a first preset length as the length of each node region in the n node regions; and determining the width of each node region in the n node regions according to the node number in the hierarchy with the most nodes in the n hierarchies.

The first preset length may be preset. Illustratively, the first preset length may be set by a technician according to actual requirements; alternatively, the first preset length may be automatically set by the terminal according to the length of the brain graph page and the layer number of the target data, for example, the terminal may subtract a preset interval value from a value obtained by dividing the length of the brain graph page by the layer number of the target data to obtain the first preset length.

Optionally, the layout of the n node regions in the brain graph page from the first node region to the nth node region may adopt an absolute positioning manner. Because the brain graph page is separated from the document flow in an absolute positioning mode, when a data card of a node is newly added in a node area in the brain graph page, the width of the node area can be determined again.

Optionally, the layout manner from the data card of the first node to the data card of the last node in each of the n node areas may be a Flex (flexible) layout manner.

(2) And the terminal determines the data area of each node in the nth hierarchy in the nth node area according to the ordering relation among the nodes in the (n-1) th hierarchy in the n hierarchies.

The data area of any node is used for displaying the data card of the node, and only one data card is displayed in one data area. In this case, the data area defining each node in the nth level corresponds to the location in the brain page where the data card defining each node is placed.

In order to ensure the aesthetic property of the brain graph page, the data card display positions of the nodes in the n layers can be associated with the data card display positions of the child nodes of each node, so that the data cards of the child nodes belonging to the same father node can be ensured to be uniformly displayed behind the data card of the father node, and the data relationship of the brain graph page is ensured to be clear. Therefore, the data area of each node in each node area needs to be determined in sequence from the last node area, and the data area of each node in the nth hierarchy is determined in the nth node area of the n node areas.

Specifically, the operation of step (2) may be: for a first node in the nth level, determining a display distance value corresponding to a first node in the nth level according to the sorting position of a parent node of the first node in the nth level in a node in the (n-1) th level, and determining a data area which is away from a target boundary of the nth node area by the display distance value corresponding to the first node in the nth level as a data area of the first node in the nth level; and for a first target node in the nth level, determining a display distance value corresponding to the first target node according to the sorting position difference between the parent node of the first target node and the parent node of the second target node and the display distance value corresponding to the second target node, and determining a data area which is away from the target boundary of the nth node area by the display distance value corresponding to the first target node as the data area of the first target node.

The display distance value corresponding to any node is the distance value of the data area where the data card of the node is located from the target boundary of the node area where the data card of the node is located. The target boundary of each node region in the n node regions may be one of an upper boundary, a lower boundary, a left boundary, and a right boundary, which is not limited in this embodiment of the present application. For example: the display distance value corresponding to the first node in the nth level is a distance value from the upper boundary of the data area of the first node in the nth level (namely, the data area where the data card of the first node is located) to the upper boundary of the nth node area.

Since each node in the nth level has no child nodes, the width of the data area of each node in the nth level may be the width of the data card for that node. That is, for any node without any sub-node, the width of the data area is the width of the data card of the node. In order to determine the data area of each node, the width of the data card of each node may be preset to a first preset width, and the first preset width may be set by a technician according to the width of the brain graph page.

The first destination node is any one of the nodes except the first node in the nth hierarchy, and the second destination node is a previous node adjacent to the first destination node in the nth hierarchy.

The operation that the terminal determines the display distance value corresponding to the first node in the nth hierarchy according to the sorting position of the parent node of the first node in the nth hierarchy in the node in the (n-1) th hierarchy can be implemented under the following three conditions.

In a first case, if a parent node of a first node in the nth level is a jth node in the (n-1) th level, accumulating a first preset interval value, a second preset interval value which is j-1 times, and a first preset width which is j-1 times to obtain a display distance value corresponding to the first node in the nth level, wherein j is a positive integer.

The first preset interval value is an interval value between a target boundary of the nth node region and the first data region in the nth node region. The first preset interval value may be preset, and the first preset interval value may be set by a technician according to the width of the brain graph page.

The second preset interval value is a distance value of an interval between two adjacent data areas in any one node area from the second node area to the last node area in the n node areas. The second preset interval value may be preset, and the second preset interval value may be set by a technician according to the width of the brain graph page.

Therefore, no matter whether two adjacent nodes belong to the same father node or not, the interval between the data areas of the two adjacent nodes is set to be the second preset interval value, and computing resources can be saved.

For example: the target data has 4 levels, and the first preset interval value is 10. And if the father node of the first node in the 4 th hierarchy is the first node in the 3 rd hierarchy, determining the first preset interval value 10 as the display distance value corresponding to the first node in the 4 th hierarchy.

Another example is: the target data has 4 levels, a first preset interval value is 10, a second preset interval value is 10, and a first preset width is 20. And if the father node of the first node in the 4 th level is the third node in the 3 rd level, accumulating the first preset interval value of 10, 2 times the second preset interval value of 10 and 2 times the first preset width of 20 to obtain a display distance value of 70 corresponding to the first node in the 4 th level.

In the second case, if the father node of the first node in the nth level is the jth node in the nth-1 level and the father nodes of the first jth node in the nth-1 level are the same node, accumulating the first preset interval value, the second preset interval value which is j-1 times and the first preset width which is j-1 times to obtain the display distance value corresponding to the first node in the nth level.

In this case, the second preset interval value is a distance value between data areas of two adjacent nodes belonging to the same parent node in any one of the node areas from the second node area to the last node area in the n node areas.

If the parent nodes of the first j nodes in the (n-1) th hierarchy are the same node, it is described that the interval values between the data areas of two adjacent nodes in the first j nodes are the same (i.e., the second preset interval value), the first preset interval value, the j-1 times of the second preset interval value, and the j-1 times of the first preset width may be accumulated to obtain the display distance value corresponding to the first node in the nth hierarchy.

For example: the target data has 4 levels, a first preset interval value is 10, a second preset interval value is 10, and a first preset width is 20. If the parent node of the first node in the 4 th hierarchy is the 2 nd node in the 3 rd hierarchy and the parent nodes of the first 2 nodes in the 3 rd hierarchy are the same node, the first preset interval value 10, the second preset interval value 10, and the first preset width 20 may be accumulated to obtain a display distance value corresponding to the first node in the 4 th hierarchy, which is 40.

In a third case, if the father node of the first node in the nth level is the jth node in the nth-1 level and the father node of the first jth node in the nth-1 level is m different nodes, accumulating the first preset interval value, the second preset interval value which is j-m times, the third preset interval value which is m-1 times and the first preset width which is j-1 times to obtain the display distance value corresponding to the first node in the nth level, wherein m is an integer which is greater than or equal to 2.

The third preset interval value is an interval value between data areas of two adjacent nodes which do not belong to the same father node, and the third preset interval value is larger than the second preset interval value. Therefore, the interval value between the data areas of two adjacent nodes which belong to the same father node is different from the interval value between the data areas of two adjacent nodes which do not belong to the same father node, so that the interval between the data areas of two adjacent nodes which do not belong to the same father node is increased, the data cards which belong to the nodes of the same father node can be displayed in a centralized manner, and the data relation of the brain graph page is clearer.

For example: the target data has 4 levels, a first preset interval value is 10, a second preset interval value is 10, a third preset interval value is 15, and a first preset width is 20. If the parent node of the first node in the 4 th hierarchy is the 2 nd node in the 3 rd hierarchy, and the parent node of the first 2 nodes in the 3 rd hierarchy is 2 different nodes, the first preset interval value 10, the third preset interval value 15, and the first preset width 20 may be accumulated, so that the display distance value corresponding to the first node in the 4 th hierarchy is 45.

The operation of determining the display distance value corresponding to the first target node by the terminal according to the sorting position difference between the parent node of the first target node and the parent node of the second target node and the display distance value corresponding to the second target node can be implemented under the following three conditions.

In a first case, if k nodes are spaced between the parent node of the first target node and the parent node of the second target node, accumulating the display distance value corresponding to the second target node, the second preset spacing value k +1 times, and the first preset width k +1 times to obtain the display distance value corresponding to the first target node, where k is an integer greater than or equal to 0.

In this case, the intervals between the data areas of two adjacent nodes are set to the second preset interval value, so that the calculation resources can be saved.

And when k is 0, the father node of the first target node is adjacent to the father node of the second target node. And when k is greater than or equal to 1, at least one other node is arranged between the father node of the first target node and the father node of the second target node.

If k nodes are spaced between the parent node of the first target node and the parent node of the second target node, the display distance value corresponding to the second target node, the sum of the spacing between the parent node of the first target node and the parent node of the second target node (i.e., k +1 times of the second preset spacing value), and the width of the data card of k +1 nodes (i.e., the k nodes and the second target node) (i.e., k +1 times of the first preset width) may be accumulated to obtain the display distance value corresponding to the first target node.

For example: the target data has 4 levels, the first preset interval value is 10, the second preset interval value is 10, the first preset width is 20, and the display distance value corresponding to the second target node is 60. If 2 nodes are spaced between the parent node of the first target node and the parent node of the second target node, the display distance value 60 corresponding to the second target node, the second preset spacing value 10 corresponding to 3 times of the display distance value, and the first preset width 20 corresponding to 3 times of the display distance value may be accumulated, and the display distance value corresponding to the first target node is obtained as 150.

In the second case, if k nodes are spaced between the father node of the first target node and the father node of the second target node, the display distance value corresponding to the second target node, the second preset spacing value which is k +1 times, and the first preset width which is k +1 times are accumulated to obtain the display distance value corresponding to the first target node under the condition that the grandfather node of the first target node and the grandfather node of the second target node are the same node.

In this case, if the grandparent node of the first target node and the grandparent node of the second target node are the same node, which indicates that the interval values between the data areas of two adjacent nodes in the k nodes are the same, the display distance value corresponding to the second target node, the sum of the intervals between the parent node of the first target node and the parent node of the second target node (i.e., the second preset interval value k +1 times), and the width of the data card of k +1 nodes (i.e., the first preset width k +1 times) may be accumulated to obtain the display distance value corresponding to the first target node.

For example: the target data has 4 levels, the first preset interval value is 10, the second preset interval value is 10, the first preset width is 20, and the display distance value corresponding to the second target node is 60. If 2 nodes are spaced between the father node of the first target node and the father node of the second target node, and the grandfather node of the first target node and the grandfather node of the second target node are the same node, the display distance value 60 corresponding to the second target node, the second preset spacing value 10 corresponding to the second target node, and the first preset width 20 corresponding to the second target node may be added up to obtain the display distance value 150 corresponding to the first target node.

In a third case, if k nodes are spaced between the father node of the first target node and the father node of the second target node, and when the grandfather node of the first target node and the grandfather node of the second target node are p different nodes, the display distance value corresponding to the second target node, the second preset interval value being k-p +2 times, the third preset interval value being p-1 times, and the first preset width being k +1 times are accumulated to obtain the display distance value corresponding to the first target node, where p is an integer greater than or equal to 2.

In this case, if the grandparent node of the first target node and the grandparent node of the second target node are p different nodes, it is described that p-1 third preset interval values exist in the interval between two adjacent nodes in the k nodes, and k-p +2 second preset interval values exist, the display distance value corresponding to the second target node, the sum of the intervals between the parent node of the first target node and the parent node of the second target node (i.e., the sum of the k-p +2 times of the second preset interval value and the p-1 times of the third preset interval value), and the width of the data card of k +1 nodes (i.e., the k nodes and the second target node) (i.e., the k +1 times of the first preset width) may be accumulated to obtain the display distance value corresponding to the first target node.

For example: the target data has 4 levels, the first preset interval value is 10, the second preset interval value is 10, the third preset interval value is 15, the first preset width is 20, and the display distance value corresponding to the second target node is 60. If 2 nodes are spaced between the father node of the first target node and the father node of the second target node, and the grandfather node of the first target node and the grandfather node of the second target node are 2 different nodes, the display distance value 60 corresponding to the second target node, the second preset interval value 10 which is 2 times, the third preset interval value 15, and the first preset width 20 which is 3 times of the second preset interval value 10 may be accumulated to obtain the display distance value 155 corresponding to the first target node.

(3) And the terminal determines the data area of each node in the ith hierarchy in the n hierarchies according to the data area of each node in the (i + 1) th hierarchy in the n hierarchies and the ith node area in the n node areas, wherein i is an integer which is greater than or equal to 2 and less than or equal to n-1.

Because the parent-child relationship exists among all levels in the target data, the data area of the node of the next level in the target data can influence the data area of the node of the previous level, so that the data area of each node in the ith level is determined in the ith node area according to the data area of each node in the (i + 1) th level, the determined data area of each node in the ith level can be more reasonable, and the data relationship presented by the brain graph page is ensured to be clearer.

Specifically, the operation of step (3) can be realized in two possible ways as follows.

The first possible manner is explained below, and the first possible manner can be realized in the following five cases.

In a first case, for a jth node in an ith level, if the jth node in the ith level has a child node, determining a display distance value corresponding to a first child node of the jth node in the ith level as a display distance value corresponding to the jth node in the ith level, wherein j is a positive integer; adding the sum of the widths of the data areas of all the sub-nodes of the jth node in the ith level and the sum of the interval values between the data areas of all the adjacent two sub-nodes of the jth node in the ith level to obtain the display width corresponding to the jth node in the ith level; and determining a data area which is away from the target boundary of the ith node area by the display distance value corresponding to the jth node in the ith hierarchy and has the width of the display width corresponding to the jth node in the ith hierarchy as the data area of the jth node in the ith hierarchy.

The target boundary of the ith node region and the target boundary of the (i + 1) th node region may be on the same straight line, and then, under the condition that the jth node in the ith hierarchy has a child node, the display distance value corresponding to the jth node in the ith hierarchy is the same as the display distance value corresponding to the first child node of the jth node in the ith hierarchy, so that the display distance value corresponding to the first child node of the jth node in the ith hierarchy may be determined as the display distance value corresponding to the jth node in the ith hierarchy.

In this case, the width of the data area of the jth node in the ith hierarchy is obtained by adding the sum of the widths of the data areas of all the child nodes of the jth node in the ith hierarchy and the sum of the interval values between the data areas of all the adjacent two child nodes of the jth node in the ith hierarchy, so that the data areas of all the child nodes belonging to the same parent node can be ensured to be in the subordinate range of the data area of the parent node, and the data relationship in the brain graph page is clearer.

For example: the target data has 4 levels, i is 2 and j is 3. FIG. 3 is a schematic diagram of the data area for defining the jth node in the ith hierarchy. Referring to fig. 3, fig. 3 includes a 2 nd node region 301, a 3 rd node region 302, data areas 303 of two sub-nodes of a third node in the 2 nd hierarchy, and a data area 304 of a third node in the 2 nd hierarchy.

The distance from the target boundary of the node area 3 to the data area 303 of the first child node of the third node in the 2 nd hierarchy is 40, that is, the display distance value corresponding to the first child node of the third node in the 2 nd hierarchy is 40, the width of the data area 303 of each child node of the third node in the 2 nd hierarchy is 12, and the interval value between the data areas 303 of two adjacent child nodes of the third node in the 2 nd hierarchy is 10. Accordingly, the display distance value corresponding to the third node in the 2 nd hierarchy is the display distance value 40 corresponding to the first child node of the third node in the 2 nd hierarchy, and the display width corresponding to the third node in the 2 nd hierarchy is the sum (24) of the widths of the data areas 303 of the two child nodes of the third node in the 2 nd hierarchy plus the interval value (10) between the data areas 303 of all the adjacent two child nodes of the third node in the 2 nd hierarchy, that is, the display width corresponding to the third node in the 2 nd hierarchy is 34. A data area 40 distant from the target boundary of the 2 nd node region 301 and having a width of 34 may be determined as the data area 304 of the third node in the 2 nd hierarchy.

In a second case, for a jth node in an ith hierarchy, if the jth node in the ith hierarchy does not have a child node and the jth node in the ith hierarchy is a first node in the ith hierarchy, determining a first preset interval value as a display distance value corresponding to the jth node in the ith hierarchy, and determining a data area which is distant from a target boundary of an ith node area by the display distance value corresponding to the jth node in the ith hierarchy as a data area of the jth node in the ith hierarchy.

Since the jth node in the ith hierarchy does not have a child node, the width of the data area of the jth node in the ith hierarchy can be directly determined as the width of the data card of the jth node in the ith hierarchy (i.e., the first preset width). That is, in this case, the width of the data area of the jth node in the ith hierarchy defaults to the first preset width.

In a third case, for a jth node in an ith hierarchy, if the jth node in the ith hierarchy does not have a child node and the jth node in the ith hierarchy is not the first node in the ith hierarchy, accumulating a first preset interval value, a sum of widths of data areas of the front j-1 nodes in the ith hierarchy, a sum of interval values between data areas of all adjacent two nodes in the front j-1 nodes in the ith hierarchy, and a second preset interval value to obtain a display distance value corresponding to the jth node in the ith hierarchy, and determining a data area, which is separated from a target boundary of the ith node area by the display distance value corresponding to the jth node in the ith hierarchy, as a data area of the jth node in the ith hierarchy.

In this case, the width of the data area of the jth node in the ith hierarchy defaults to the width of the data card of the jth node in the ith hierarchy, that is, defaults to the first preset width.

For example: the target data has 4 levels, i is 2, j is 3, the first preset interval value is 10, the second preset interval value is 10, and the first preset width is 12. FIG. 4 is a schematic diagram of the data area for defining the jth node in the ith hierarchy. Referring to fig. 4, fig. 4 includes a 2 nd node region 401, a 3 rd node region 402, data areas 403 of the first two nodes in the 2 nd hierarchy, and a data area 404 of the third node in the 2 nd hierarchy. A distance value (i.e., a first preset interval value) between the first data region 403 in the 2 nd node region 401 and the target boundary of the 2 nd node region 401 is 10, a width of each data region 403 in the first two data regions 403 in the 2 nd node region 401 is 12, and an interval value between the first data region 403 and the second data region 403 in the 2 nd node region 401 is 10. The sum 54 of the first preset interval value (10), the sum (24) of the widths of the data areas 403 of the first two nodes in the 2 nd node area 401, the interval value (10) between the data areas 403 of the first two nodes in the 2 nd node area 401, and the second preset interval value (10) is the display distance value corresponding to the third node in the 2 nd hierarchy. A data region 54 distant from the target boundary of the 2 nd node region 401 and having a width of 12 may then be determined as the data region 404 of the third node in the 2 nd hierarchy.

In a fourth case, for a jth node in an ith hierarchy, if the jth node in the ith hierarchy does not have a child node and the jth node in the ith hierarchy is not the first node in the ith hierarchy, accumulating a first preset interval value, a sum of widths of data areas of previous j-1 nodes in the ith hierarchy, a sum of interval values between data areas of all adjacent two nodes in the previous j-1 nodes in the ith hierarchy, and a second preset interval value to obtain a display distance value corresponding to the jth node in the ith hierarchy under the condition that a parent node of the jth node in the ith hierarchy and a parent node of the jth-1 node are the same node; and determining a data area which is away from the target boundary of the ith node area by the display distance value corresponding to the jth node in the ith hierarchy as the data area of the jth node in the ith hierarchy.

And if the parent node of the jth node in the ith hierarchy and the parent node of the jth node are the same node, the interval value between the data area of the jth node in the ith hierarchy and the data area of the jth node in the jth-1 hierarchy is a second preset interval value. Therefore, the first preset interval value, the sum of the widths of the data areas of the first j-1 nodes in the ith layer, the sum of the interval values between the data areas of all the adjacent two nodes in the first j-1 nodes in the ith layer and the second preset interval value can be accumulated to obtain the display distance value corresponding to the jth node in the ith layer.

In a fifth case, for a jth node in an ith hierarchy, if the jth node in the ith hierarchy does not have a child node and the jth node in the ith hierarchy is not the first node in the ith hierarchy, accumulating the first preset interval value, the sum of the widths of the data areas of the previous j-1 nodes in the ith hierarchy, the sum of the interval values between the data areas of all adjacent two nodes in the previous j-1 nodes in the ith hierarchy, and the third preset interval value to obtain a display distance value corresponding to the jth node in the ith hierarchy under the condition that the parent node of the jth node in the ith hierarchy and the parent node of the jth-1 node are different nodes; and determining a data area which is away from the target boundary of the ith node area by the display distance value corresponding to the jth node in the ith hierarchy as the data area of the jth node in the ith hierarchy, wherein the third preset interval value is larger than the second preset interval value.

If the parent node of the jth node in the ith hierarchy and the parent node of the jth node are different nodes, it is described that the interval value between the data area of the jth node in the ith hierarchy and the data area of the jth-1 node is different from the interval value (i.e., a second preset interval value) between the data areas of two adjacent nodes belonging to the same parent node, that is, the interval value between the data area of the jth node in the ith hierarchy and the data area of the jth-1 node is a third preset interval value. Therefore, the data areas of the nodes belonging to the same father node can be displayed in a centralized mode, and the data relation of the brain graph page can be clearer.

For example: the target data has 4 levels, i is 2, j is 3, the first preset interval value is 10, the third preset interval value is 15, and the first preset width is 12. FIG. 5 is a schematic diagram of the data area for defining the jth node in the ith hierarchy. Referring to fig. 5, fig. 5 includes a 2 nd node region 501, a 3 rd node region 502, data areas 503 of the first two nodes in the 2 nd hierarchy, and a data area 504 of the third node in the 2 nd hierarchy. The width of each data area 503 of the first two data areas 503 in the 2 nd node area 501 is 12, and the interval value between the first data area 503 and the second data area 503 in the 2 nd node area 501 is 10. The sum 59 of the first preset interval value (10), the sum (24) of the widths of the data areas 503 of the first two nodes in the 2 nd node area 501, the interval value (10) between the data areas 503 of the first two nodes in the 2 nd node area 501, and the third preset interval value (15) is the display distance value corresponding to the third node in the 2 nd hierarchy. A data region 59 distant from the target boundary of the 2 nd node region 501 and having a width of 12 may then be determined as the data region 504 of the third node in the 2 nd hierarchy.

The second possible manner is explained below, and the second possible manner can be realized in the following three cases.

In a first case, for a jth node in an ith hierarchy, if the jth node in the ith hierarchy is a first node in the ith hierarchy, determining a first preset interval value as a display distance value corresponding to the jth node in the ith hierarchy. Under the condition that a sub node does not exist in a jth node in an ith hierarchy, determining a data area which is away from a target boundary of an ith node area by a display distance value corresponding to the jth node in the ith hierarchy as a data area of the jth node in the ith hierarchy, wherein the width of the data area of the jth node in the ith hierarchy defaults to the width of a data card of the jth node in the ith hierarchy, namely the default width is a first preset width. And under the condition that a jth node in the ith hierarchy has a sub-node, adding the sum of the widths of the data areas of all sub-nodes of the jth node in the ith hierarchy to the sum of the interval values of the data areas of all two adjacent sub-nodes of the jth node in the ith hierarchy to obtain the display width corresponding to the jth node in the ith hierarchy, and determining the data area which is away from the target boundary of the ith node area by the display distance value corresponding to the jth node in the ith hierarchy and has the width of the display width corresponding to the jth node in the ith hierarchy as the data area of the jth node in the ith hierarchy.

For example: the target data has 4 levels, i is 2, j is 1, the first preset interval value is 10, and the first preset width is 12. FIG. 6 is a schematic diagram of the data area defining the first node in the ith hierarchy. Referring to fig. 6, fig. 6 includes a 2 nd node region 601, a 3 rd node region 602, and a data area 603 of a first node in the 2 nd hierarchy. The first node in level 2 has no child nodes. The display distance value corresponding to the first node in the 2 nd hierarchy is a first preset interval value of 10, and since the first node in the 2 nd hierarchy has no child node, it may be determined that the data area 10 away from the target boundary of the 2

nd node region

601 and 12 wide is the data area 603 of the first node in the 2 nd hierarchy.

Another example is: the target data has 4 levels, i is 2, j is 1, the first preset interval value is 10, the second preset interval value is 10, and the first preset width is 12. FIG. 7 is a schematic diagram of the data area defining the first node in the ith hierarchy. Referring to fig. 7, fig. 7 includes a 2 nd node region 701, a 3 rd node region 702, a data area 703 of a first node in the 2 nd hierarchy, and a data area 704 of two sub-nodes of the first node in the 2 nd hierarchy. The display distance value corresponding to the first node in the 2 nd level is a first preset interval value 10. The sum (24) of the widths of the data fields 704 of the two sub-nodes of the first node in the 2 nd level is added to the interval value (10) between the data fields 704 of all the adjacent two sub-nodes of the first node in the 2 nd level, resulting in a display width of 34 corresponding to the first node in the 2 nd level. Thus, it can be determined that the data region 10 away from the target boundary of the 2

nd node region

701 and 34 wide is the data region 703 of the first node in the 2 nd hierarchy.

In a second case, for a jth node in an ith hierarchy, if the jth node in the ith hierarchy is not the first node in the ith hierarchy, accumulating a display distance value corresponding to the jth node in the ith hierarchy, a width of a data area of the jth node in the ith hierarchy, and a second preset interval value to obtain a display distance value corresponding to the jth node in the ith hierarchy, or accumulating a display distance value corresponding to the jth node in the ith hierarchy, a width of a data area of the jth node in the ith hierarchy, and a third preset interval value, if the jth node in the ith hierarchy is not the first node in the ith hierarchy, a display distance value corresponding to the jth node in the ith hierarchy, a width of a data area of the jth node in the ith hierarchy, and a third preset interval value, and obtaining a display distance value corresponding to the jth node in the ith hierarchy. Under the condition that a sub node does not exist in a jth node in an ith hierarchy, determining a data area which is away from a target boundary of an ith node area by a display distance value corresponding to the jth node in the ith hierarchy as a data area of the jth node in the ith hierarchy, wherein the width of the data area of the jth node in the ith hierarchy defaults to the width of a data card of the jth node in the ith hierarchy, namely the default width is a first preset width. And under the condition that a sub-node exists in a jth node in the ith hierarchy, adding the sum of the widths of the data areas of all sub-nodes of the jth node in the ith hierarchy to the sum of the interval values between the data areas of all two adjacent sub-nodes of the jth node in the ith hierarchy to obtain the display width corresponding to the jth node in the ith hierarchy, and determining the data area which is away from the target boundary of the ith node area by the display distance value corresponding to the jth node in the ith hierarchy and has the width of the display width corresponding to the jth node in the ith hierarchy as the data area of the jth node in the ith hierarchy.

For example: the target data has 4 levels, i is 2, j is 3, the second preset interval value is 10, and the first preset width is 12. FIG. 8 is a schematic diagram of the data area for defining the jth node in the ith hierarchy. Referring to fig. 8, fig. 8 includes a 2 nd node area 801, a 3 rd node area 802, data areas 803 of the first two nodes in the 2 nd hierarchy, and a data area 804 of the third node in the 2 nd hierarchy. The father node of the second node and the father node of the third node in the 2 nd level are the same node. The display distance value corresponding to the second node in the 2 nd level is 40, the width of the data area of the second node in the 2 nd level is 12, and the third node in the 2 nd level has no child node. Then the display distance value (40) corresponding to the 2 nd node, the width (12) of the data area of the second node in the 2 nd level, and the second preset interval value (10) are accumulated to obtain a display distance value 62 corresponding to the third node in the 2 nd level. Since the third node in the 2 nd hierarchy has no child node, it is determined that the data area having a width of 12 and a distance of 62 from the target boundary of the 2 nd node region 801 is the data area 804 of the third node in the 2 nd hierarchy.

Another example is: the target data has 4 levels, i is 2, j is 3, the second preset interval value is 10, and the first preset width is 12. FIG. 9 is a schematic diagram of the data area for defining the jth node in the ith hierarchy. Referring to fig. 9, fig. 9 includes a 2 nd node region 901, a 3 rd node region 902, data areas 903 of the first two nodes in the 2 nd hierarchy, a data area 904 of the third node in the 2 nd hierarchy, and data areas 905 of the two sub-nodes of the third node in the 2 nd hierarchy. The father node of the second node and the father node of the third node in the 2 nd level are the same node. The display distance value corresponding to the second node in the 2 nd hierarchy is 40, and the width of the data area of the second node in the 2 nd hierarchy is 12. Then the display distance value (40) corresponding to the 2 nd node, the width (12) of the data area of the second node in the 2 nd level, and the second preset interval value (10) are accumulated to obtain a display distance value 62 corresponding to the third node in the 2 nd level. If the sum (24) of the widths of the data areas 905 of the two sub-nodes of the third node in the 2 nd hierarchy is added to the interval value (10) between the data areas 905 of all the adjacent two sub-nodes of the third node in the 2 nd hierarchy to obtain the display width 34 corresponding to the third node in the 2 nd hierarchy, it can be determined that the data area which is 62 away from the target boundary of the node area 901 in the 2 nd hierarchy and has the width of 34 is the data area 904 of the third node in the 2 nd hierarchy.

In a third case, for a jth node in the ith hierarchy, if the jth node in the ith hierarchy is not the first node in the ith hierarchy, accumulating the display distance value corresponding to the jth-1 node in the ith hierarchy, the width of the data area of the jth-1 node in the ith hierarchy and the second preset interval value to obtain the display distance value corresponding to the jth node in the ith hierarchy. Under the condition that a sub node does not exist in a jth node in an ith hierarchy, determining a data area, which is away from a target boundary of an ith node area and corresponds to a jth node in the ith hierarchy, as a data area of the jth node in the ith hierarchy, wherein under the condition, the width of the data area of the jth node in the ith hierarchy defaults to the width of a data card of the jth node in the ith hierarchy, namely defaults to a first preset width. And under the condition that a sub-node exists in a jth node in the ith hierarchy, adding the sum of the widths of the data areas of all sub-nodes of the jth node in the ith hierarchy to the sum of the interval values between the data areas of all two adjacent sub-nodes of the jth node in the ith hierarchy to obtain the display width corresponding to the jth node in the ith hierarchy, and determining the data area which is away from the target boundary of the ith node area by the display distance value corresponding to the jth node in the ith hierarchy and has the width of the display width corresponding to the jth node in the ith hierarchy as the data area of the jth node in the ith hierarchy.

(4) The terminal determines the data area of each node in the 1 st hierarchy in the 1 st node area of the n node areas.

In some embodiments, the operation of step (4) may be: for a first node in the 1 st level, determining a fourth preset interval value as a display distance value corresponding to the first node in the 1 st level, and determining a data area which is away from a target boundary of the 1 st node area by the display distance value corresponding to the first node in the 1 st level as a data area of the first node in the 1 st level; for the s-th node in the 1 st level, accumulating the display distance value corresponding to the s-1-th node in the 1 st level, the width of the data area of the s-1-th node in the 1 st level, and a fifth preset interval value, or accumulating the display distance value corresponding to the s-1-th node in the 1 st level, the width of the data area of the s-1-th node in the 1 st level, and a sixth preset interval value to obtain the display distance value corresponding to the s-th node in the 1 st level, and determining the data area which is away from the target boundary of the 1-th node area by the display distance value corresponding to the s-th node in the 1 st level as the data area of the s-th node in the 1 st level, wherein s is an integer greater than or equal to 2.

The fourth preset interval value is an interval value between the target boundary of the 1 st node region and the first data area of the 1 st node region. The fourth preset interval value may be preset, and the fourth preset interval value may be set by a technician according to the width of the brain graph page.

The fifth preset interval value and the sixth interval value are interval values between two adjacent data areas in the 1 st node area, the fifth preset interval value and the sixth interval value may be preset, and the fifth preset interval value and the sixth interval value may be set by a technician according to the width of the brain graph page.

Optionally, the target data further includes attribution information of the node of the 1 st level, for example: two companies cooperate with one project at the same time, two nodes in the 1 st level are project data of the two companies respectively, and then the company name in the project data is attribution information.

Optionally, the terminal may display the attribution information of each node in the 1 st hierarchy in the data card of the corresponding node, or may display the attribution information of each node separately. If the attribution information of each node is displayed independently, a data card for displaying the attribution information can be generated, and the width of the data card for displaying the attribution information can be preset.

And sequentially determining the data areas of the nodes with the same attribution information when determining the data area of each node in the 1 st hierarchy, and after the data areas of the nodes with the same attribution information are determined, determining the data area of the node with another attribution information. The interval value between the data areas of two adjacent nodes having different attribution information and the interval value between the data areas of the nodes having the same attribution information may be set to be different. For example: the interval value between the data areas of two adjacent nodes having the same attribution information may be set to a fifth preset interval value, the interval value between the data areas of two adjacent nodes having different attribution information may be set to a sixth preset interval value, and the sixth preset interval value is greater than the fifth preset interval value.

In this case, for the s-th node in the 1 st level, if the attribution information of the s-th node in the 1 st level is the same as that of the s-1 th node, the display distance value corresponding to the s-1 th node in the 1 st level, the width of the data area of the s-1 th node in the 1 st level, and the fifth preset interval value are accumulated to obtain the display distance value corresponding to the s-th node in the 1 st level. And if the attribution information of the s-th node in the 1 st level is different from the attribution information of the s-1 st node, accumulating the display distance value corresponding to the s-1 st node in the 1 st level, the width of the data area of the s-1 st node in the 1 st level and a sixth preset interval value to obtain the display distance value corresponding to the s-th node in the 1 st level.

Alternatively, the width of the data card of the node at the 1 st level may be the same as the width of the data cards of the nodes at the other levels except for the 1 st level (i.e., the first preset width), or may be different from the width of the data cards of the nodes at the other levels except for the 1 st level. For example: the width of the data card of the node at the 1 st level may be set to a second preset width, and the second preset width may be smaller than the first preset width.

For example: s is 3, the width of the data card of the node of the 1 st level is a first preset width, the first preset width is 12, and the attribution information of the node is displayed on the data card of the node. FIG. 10 is a schematic diagram of the determination of the data area for each node in level 1. Referring to fig. 10, fig. 10 includes a node region 1, data areas 1002 of the first two nodes in the 1 st hierarchy, and a data area 1003 of the third node in the 1 st hierarchy. The second node and the third node in the 1 st level do not have the same attribution information, the display distance value corresponding to the second node in the 1 st level is 35, and the sixth preset interval value is 20. Then the display distance value 35 corresponding to the second node in the 1 st level, the width 12 of the data area of the second node in the 1 st level, and the sixth preset interval value 20 are accumulated to obtain a display distance value 67 corresponding to the third node in the 1 st level, and then the data area which is 67 away from the target boundary of the 1 st node area 1001 and has a width of 12 may be determined to be the data area 1003 of the third node in the 1 st level.

In other embodiments, the 1 st node area of the n node areas may display not only the data card of each node in the 1 st hierarchy, but also a first button and a second button for adding a node.

The first button is used for adding nodes with different attribution information, the width of the first button is a third preset width, and the first button can be displayed above the data areas of all the nodes in the 1 st node area. The second button is used to add nodes having the same attribution information, the width of the second button is a fourth preset width, and the second button may be displayed below the data area of the node having the same attribution information in the 1 st node area. The third preset width and the fourth preset width may both be preset, and the third preset width and the fourth preset width may be set by a technician according to the width of the brain graph page.

In this case, the operation of step (4) may be: and for the first node in the 1 st level, accumulating the fourth preset interval value, the third preset width, the seventh preset interval value and the fifth preset width to obtain a display distance value corresponding to the first node in the 1 st level, and determining a data area which is away from the target boundary of the 1 st node area by the display distance value corresponding to the first node in the 1 st level as the data area of the first node in the 1 st level.

For the s node in the 1 st level, under the condition that the s node and the s-1 node in the 1 st level have the same attribution information, accumulating the display distance value corresponding to the s-1 node in the 1 st level, the width of the data area of the s-1 node in the 1 st level and a fifth preset interval value to obtain a display distance value corresponding to the s node in the 1 st level; or, under the condition that the s-th node and the s-1 th node in the 1 st level have different attribution information, accumulating the display distance value corresponding to the s-1 th node in the 1 st level, the width of the data area of the s-1 th node in the 1 st level, the eighth preset interval value, the fourth preset width, the ninth preset interval value and the fifth preset width to obtain the display distance value corresponding to the s-th node in the 1 st level. And determining a data area which is away from the target boundary of the 1 st node area by the display distance value corresponding to the s-th node in the 1 st hierarchy as the data area of the s-th node in the 1 st hierarchy, wherein s is an integer greater than or equal to 2.

In this case, the attribution information of each node is displayed separately, and the fifth preset width is the width of the generated data card for displaying the attribution information.

The seventh preset interval value is the interval value between the first button and the data card of the first attribution information in the 1 st hierarchy. The seventh preset interval value may be preset, and the seventh preset interval value may be set by a technician according to the width of the 1 st node region.

The eighth preset interval value is an interval value between the second button and the data area of the s-1 st node in the 1 st hierarchy. The eighth preset interval value may be set in advance, and the eighth preset interval value may be set by a technician according to the width of the 1 st node region.

The ninth preset interval value is an interval value between the second button and the data card of the next attribution information. The ninth preset interval value may be set in advance, and the ninth preset interval value may be set by a technician according to the width of the 1 st node region.

For example, s is 2, the width of the data card of the node at the 1 st level is a second preset width, the second preset width is 15, the width of the data card of the attribution information of the node at the 1 st level is a fifth preset width, and the fifth preset width is 15. FIG. 11 is a schematic diagram of the determination of the data area for each node in level 1. Referring to fig. 11, fig. 11 includes a 1 st node area 1101, a first button 1102, a data card 1103 of attribution information, a data area 1104 of a first node in the 1 st hierarchy, a second button 1105, and a data area 1106 of a second node in the 1 st hierarchy. The distance value between the first button 1102 and the target boundary of the 1 st node area 1101 is a fourth preset distance value, the width of the first button 1102 is a third preset width, and the distance value between the first button 1102 and the first attributive information data card 1103 is a seventh preset distance value, so that the display distance value corresponding to the first node in the 1 st level is obtained by accumulating the fourth preset distance value, the third preset width, the seventh preset distance value and the fifth preset width. Assume that the display distance value corresponding to the first node in the 1 st hierarchy is 40, and the width (i.e., the fourth preset width) of the second button 1105 is 10. The interval value between the second button 1105 and the data area 1104 of the first node in the 1 st hierarchy is an eighth preset interval value, assuming that the eighth preset interval value is 5, the interval value between the second button 1105 and the data card 1103 of the second attribution information in the 1 st hierarchy is a ninth preset interval value, assuming that the ninth preset interval value is 20, the display distance value corresponding to the second node in the 1 st hierarchy is the display distance value (40) corresponding to the first node in the 1 st hierarchy, the width (15) of the data area of the first node in the 1 st hierarchy, the eighth preset interval value (5), the fourth preset width (10), the ninth preset interval value (20), and the fifth preset width (15) are accumulated, and the display distance value corresponding to the second node in the 1 st hierarchy is 105. The data area 105 from the target boundary of the node 1 region and 15 wide may then be determined to be the data area 1106 of the second node in level 1.

It should be noted that after the terminal determines the data area of each node in the n node areas, the terminal may record the display distance value corresponding to each node (i.e., the distance value between the data area of each node and the target boundary of the node area where the node is located) and the display width corresponding to each node (i.e., the width of the data area of each node), so as to be used later.

(5) The terminal displays the data card of each node in the data area of each node in the n levels.

Optionally, the manner in which the terminal displays the data card of each node in the data area of each node in the n hierarchies may be a center display, a top display, a bottom display, or the like, which is not limited in this embodiment of the present application.

Step 104: and drawing connecting lines among the data cards of the nodes displayed in the brain graph page by the terminal according to the parent-child relationship among the nodes of the n layers.

Alternatively, the terminal may draw the connecting lines between the data cards of the nodes displayed in the brain graph page through the < svg > tag, and the connecting lines drawn through the < svg > tag are scalable vector graphics, which have no loss of quality in case of enlargement or size change. Thus, the brain map in the brain map page can be clearly displayed at any resolution.

Specifically, the operation of step 104 may be: for any two nodes with a parent-child relationship in the n levels of nodes, determining a connecting line endpoint corresponding to each node in the two nodes according to a data area where data cards of the two nodes are located in the brain graph page; and drawing a connecting line between the data cards of the two nodes according to the connecting line terminal corresponding to each node in the two nodes.

Under the condition, the terminal only needs to determine the connecting line end point corresponding to each node in the two nodes, and then the connecting line end points are connected to draw the connecting line between the data cards of the two nodes, so that the process of drawing the connecting line is simpler, and meanwhile, the computing resources are saved.

For example: fig. 12 is a schematic view of a connection line between data cards of two nodes. Referring to fig. 12, fig. 12 includes a 2 nd node region 1201, a 3 rd node region 1202, a data card 1203 displayed in the 2 nd node region, two data cards 1204 displayed in the 3 rd node region, a connection line 1205 between the data card 1203 displayed in the 2 nd node region and the first data card 1204 displayed in the 3 rd node region, and a connection line 1206 between the data card 1203 displayed in the 2 nd node region and the second data card 1204 displayed in the 3 rd node region.

The operation of determining, by the terminal, the connection line end point corresponding to each of the two nodes according to the data area where the data cards of the two nodes are located in the brain map page may be: for any node in the two nodes, adding a numerical value obtained by multiplying the width of a data area where a data card of the node is located in the brain graph page by t and a display distance value corresponding to the node to obtain a target distance value; and determining a position point which is in the data area where the data card of the node is positioned and is away from the target boundary of the node area where the data card of the node is positioned by a target distance value as a connecting line end point corresponding to the node.

t may be set in advance. The terminal can determine the value of t according to the display position of the data card of the node in the data area of the node, wherein t is greater than 0 and less than 1. For example: if the data card for this node is displayed centrally in the data area for this node, then the value of t is 0.5.

Because the target distance value is obtained by adding a numerical value obtained by multiplying the width of the data area where the data card of the node is located by t and the display distance value corresponding to the node, the connecting line end point corresponding to the node is determined to be located at the position of the data card of the node according to the target distance value, and therefore the data relation in a brain graph drawn according to the connecting line end point corresponding to the node is clear.

For example: fig. 13 is a schematic diagram of determining the endpoint of a connecting line for each of two nodes. Referring to fig. 13, fig. 13 includes a node area 2, a node area 3, a data card 1303 of a node displayed in the node area 2, a data card 1304 of a node displayed in the node area 3, a connecting line terminal 1305 corresponding to a node (parent node) of the two nodes, and a connecting line terminal 1306 corresponding to another node (child node) of the two nodes. The two nodes have a parent-child relationship. The data cards for both nodes are displayed centrally in the data area, so t can be set to 0.5.

The width of the data area in which the data card 1303 of the parent node displayed in the 2 nd node area 1301 is located is 34, the width of the data area in which the data card 1304 of the child node displayed in the 3 rd node area 1302 is located is 12, the display distance value corresponding to the parent node is 25, and the display distance value corresponding to the child node is 25. Then, the display distance value 25 corresponding to the parent node is added to the width 34 of the data area where the data card 1303 of the parent node is located, which is 0.5 times the width of the data area where the data card 1303 of the parent node is located, so as to obtain a target distance value of 42, and then a position point, which is away from the target boundary of the 2 nd node area 1301 by 42, in the data area where the data card 1303 of the parent node is located is taken as a connecting line end 1305 corresponding to the parent node. Adding 0.5 times of the width 12 of the data area where the data card 1304 of the sub-node is located to the display distance value 25 corresponding to the sub-node can obtain that the target distance value is 31, and then taking a position point, which is 31 away from the target boundary of the 3 rd node area 1302, in the data area where the data card 1304 of the sub-node is located as a connecting line end 1306 corresponding to the sub-node.

The terminal can draw the connecting line between the data cards of the two nodes according to the connecting line end corresponding to each node in the two nodes under the following two conditions.

In the first case, if a parent node of the two nodes is a node of the ith hierarchy, a first reference line is determined in a spacing region between the ith node region and the (i + 1) th node region; determining a first position point which is away from a straight line where a target boundary of the ith node area is located by a first distance value in the first reference line; determining a second position point which is away from a straight line where a target boundary of the (i + 1) th node region is located by a second distance value in the first reference line; and sequentially drawing a connecting line end point, a first position point and a second position point corresponding to a father node in the two nodes and lines between the connecting line end points corresponding to sub-nodes in the two nodes to obtain the connecting line between the data cards of the two nodes.

The first reference line is used as a reference from which a first location point and a second location point are determined. The first reference line is perpendicular to a straight line where the target boundary of the ith node region and the target boundary of the (i + 1) th node region are located. The target boundary of the ith node region and the target boundary of the (i + 1) th node region are on the same straight line.

The first distance value is a distance value between a connection end point corresponding to a parent node of the two nodes and a target boundary of the ith node region. The second distance value is a distance value between a connection end point corresponding to a child node of the two nodes and a target boundary of the i +1 th node region.

For example: the parent node of the two nodes is the node of the 2 nd level, and the child node of the two nodes is the node of the 3 rd level. As shown in fig. 14, fig. 14 is a schematic diagram for drawing a connection line between data cards of two nodes, where fig. 14 includes a 2 nd node area 1401, a 3 rd node area 1402, a first reference line 1403, a first position point 1404, a second position point 1405, a data card 1406 displayed in the 2 nd node area 1401, a data card 1407 displayed in the 3 rd node area 1402, a connection line end 1408 corresponding to a parent node of the two nodes, and a connection line end 1409 corresponding to a child node of the two nodes. Wherein the first location point 1404 and the second location point 1405 are both located on the first reference line 1403. The distance between the first position point 1404 and the straight line where the target boundary of the 2 nd node region 1401 is located is equal to the distance between the connecting line end 1408 corresponding to the parent node and the target boundary of the 2 nd node region 1401, and the distance between the second position point 1405 and the straight line where the target boundary of the 3 rd node region 1402 is located is equal to the distance between the connecting line end 1409 corresponding to the child node and the target boundary of the 3 rd node region 1402. Then the connection line end 1408 corresponding to the parent node is connected to the first position point 1404, the first position point 1404 is connected to the second position point 1405, and the second position point 1405 is connected to the connection line end 1409 corresponding to the child node, thereby obtaining the connection line between the data card 1406 of the parent node and the data card 1407 of the child node.

It should be noted that if there is only one node in the 1 st level, the connection line between the data card of the node in the 1 st level and the data card of the node in the 2 nd level can be drawn according to the steps in the first case. If the 1 st level includes a plurality of nodes, the connection line between the data card of the 1 st level node and the data card of the 2 nd level node is drawn according to the following steps in the second case.

In the second case, if a parent node of the two nodes is a node of the 1 st hierarchy, in the case that the 1 st hierarchy includes a plurality of nodes, a second reference line and a third reference line are determined in a spacing region between the 1 st node region and the 2 nd node region of the n node regions; determining a third position point which is away from the straight line where the target boundary of the 1 st node area is located by a third distance value in the second reference line; determining a fourth position point which is away from the straight line where the target boundary of the 2 nd node area is located by a fourth distance value in the third reference line; adding the sum of the widths of the data areas of the plurality of nodes in the 1 st level and the sum of the interval values between the data areas of all the adjacent two nodes in the plurality of nodes in the 1 st level to obtain a target numerical value; adding a numerical value obtained by dividing the target numerical value by 2 to a display distance value corresponding to a first node in the 1 st level to obtain a fifth distance value; determining a fifth position point which is away from the straight line where the target boundary of the 1 st node region is located by a fifth distance value in the second reference line, and determining a sixth position point which is away from the straight line where the target boundary of the 2 nd node region is located by the fifth distance value in the third reference line; and sequentially drawing a connecting line end point, a third position point, a fifth position point, a sixth position point, a fourth position point and a line between the connecting line end points corresponding to the father node, the sixth position point and the fourth position point of the two nodes, and obtaining the connecting line between the data cards of the two nodes.

The second reference line is used as a reference object from which a third position point and a fifth position point are determined. The third reference line is used as a reference object from which a fourth position point and a sixth position point are determined. The second reference line and the third reference line are both perpendicular to a straight line where the target boundary of the 1 st node area and the target boundary of the 2 nd node area are located, and the target boundary of the 1 st node area and the target boundary of the 2 nd node area are on the same straight line. The second reference line is located between the 1 st node region and the third reference line.

The third distance value is a distance value between a connection end point corresponding to a parent node of the two nodes and a target boundary of the node region 1. The fourth distance value is a distance value between a connection end point corresponding to a child node of the two nodes and a target boundary of the 2 nd node region.

Since the fifth distance value is obtained by adding the display distance value corresponding to the first node in the 1 st hierarchy to the target value of 0.5 times, and the target value is obtained by adding the sum of the widths of the data areas of the plurality of nodes in the 1 st hierarchy to the sum of the interval values between the data areas of all the adjacent two nodes in the plurality of nodes in the 1 st hierarchy, the fifth position point and the sixth position point determined according to the fifth distance value are located in the middle part of the entire subordinate range of the data areas of all the nodes displayed in the first node region. Therefore, the data relation in the drawn brain graph is clearer and more attractive.

For example: as shown in fig. 15, fig. 15 is a schematic diagram illustrating a connection line between data cards of two nodes, where fig. 15 includes: a 1 st node region 1501, a 2 nd node region 1502, a second reference line 1503, a third reference line 1504, a third position point 1505, a fourth position point 1506, a fifth position point 1507, a sixth position point 1508, a data card 1509 of a parent node displayed in the 1 st node region 1501, a data card 1510 of a child node displayed in the 2 nd node region 1502, a connecting line end 1511 corresponding to the parent node, and a connecting line end 1512 corresponding to the child node. Wherein the third 1505 and fifth 1507 location points lie along the second reference line 1503 and the fourth 1506 and sixth location point 1508 lie along the third reference line 1504. The distance between the third position point 1505 and the straight line where the target boundary of the 1 st node region 1501 is located is equal to the distance between the connecting line end 1511 corresponding to the parent node and the target boundary of the 1 st node region 1501. The distance between the fourth position point 1506 and the straight line where the target boundary of the 2 nd node area 1502 is equal to the distance between the connecting line end 1512 corresponding to the sub-node and the target boundary of the 1 st node area 1501. The distance between the fifth position point 1507 and the straight line on which the target boundary of the 1 st node region 1501 is located is equal to the distance between the sixth position point 1508 and the straight line on which the target boundary of the 2 nd node region 1502 is located. The connecting line terminal 1511 corresponding to the parent node is connected to the third location point 1505, the third location point 1505 is connected to the fifth location point 1507, the fifth location point 1507 is connected to the sixth location point 1508, the sixth location point 1508 is connected to the fourth location point 1506, the fourth location point 1506 is connected to the connecting line terminal 1512 corresponding to the child node, and the connecting line between the data card 1509 of the parent node and the data card 1510 of the child node is obtained.

It should be noted that the connecting lines between the data cards of the two nodes drawn in the above two cases are relatively neat and beautiful, so that the data flow in the brain graph page is clearer.

The terminal may draw an electroencephalogram of the target data in the electroencephalogram page through the above steps 101 to 104. In this case, the terminal may further trace the source of the node to which any one of the data cards displayed in the brain graph page belongs.

Specifically, if the terminal detects a selection operation on any one data card in the brain graph page, all nodes associated with the node to which the data card belongs are determined from the nodes of the n layers; highlighting the data cards of all nodes associated with the node to which the data card belongs; and highlighting the connecting lines among the data cards of all the nodes related to the node to which the data card belongs.

The selection operation is used to indicate that the data card is selected, and the node to which the data card belongs needs to be traced. The selection operation may be triggered by a user, for example, the user may trigger the selection operation on the data card by clicking the data card.

Because the data cards in the embodiment of the application can be triggered, the terminal can directly detect the selection operation of any data card, and then can determine which node the node of the data card belongs to, so that the node of the data card belongs to can be traced more quickly, and the tracing operation of the node of any data card is more convenient and quicker.

When tracing the node to which the data card belongs, the terminal can highlight the data cards of all nodes associated with the node to which the data card belongs and the connecting lines between the data cards of all nodes associated with the node to which the data card belongs, so that a user can timely know all nodes associated with the node to which the data card belongs and the relationship between the nodes.

In a possible mode, the manner in which the terminal highlights the connection lines between the data cards of all nodes associated with the node to which the data card belongs is as follows: the color value of the stroke attribute of the connecting line between the data cards of all the nodes associated with the node to which the data card belongs is set to a value different from the original color value (i.e., the default color value).

In another possible manner, the operation of the terminal highlighting the connection lines between the data cards of all nodes associated with the node to which the data card belongs may be: and the terminal redraws the connecting lines among the data cards of all the nodes related to the node to which the data card belongs according to the parent-child relationship among all the nodes related to the node to which the data card belongs, and highlights the redrawn connecting lines.

When the < svg > label is used for drawing the connecting line between the two data cards, the drawn latter line always covers the part of the former line, which is overlapped with the latter line. In this case, if the line drawn later has a portion overlapping the previous line, the previous line cannot be displayed on the electroencephalogram page even if the previous line is highlighted. Therefore, it is necessary to redraw the connection lines between the data cards of all nodes associated with the node to which the data card belongs, and to highlight the redrawn connection lines.

Wherein, when the terminal highlighted the connecting wire of redrawing, can set up the colour value of the stroke attribute of the connecting wire of redrawing to the value different with original colour value (being default colour value).

Optionally, when the terminal detects a deselection operation for the data card, the terminal cancels highlighting of the data cards of all nodes associated with the node to which the data card belongs, and cancels highlighting of the connection lines between the data cards of all nodes associated with the node to which the data card belongs.

The deselection operation may be triggered by the user, for example, the user may trigger the deselection operation for another data card by clicking on the data card, or the user may trigger the deselection operation for the data card by clicking on a blank area in the brain graph page.

Optionally, the manner in which the terminal cancels the highlighting of the connecting lines between the data cards of all nodes associated with the node to which the data card belongs is as follows: and setting the color value of the stroke attribute of the connecting line between the data cards of all the nodes associated with the node to which the data card belongs as a default color value.

As an example, if a user wants to know the source of a node to which a data card belongs, the user moves a mouse and clicks and selects the data card to trigger a selection operation on the data card, in response to the selection operation, the terminal highlights the data cards of all nodes associated with the node to which the data card belongs and highlights connecting lines between the data cards of all nodes associated with the node to which the data card belongs, and at this time, the user can know the source of the node to which the data card belongs according to the highlighted contents. Then, if the user does not want to view the source of the node to which the data card belongs, the mouse can be moved to the blank area and the blank area is clicked to trigger the deselection operation of the data card, and in response to the deselection operation, the terminal cancels highlighting of the data cards of all nodes associated with the node to which the data card belongs and highlighting of connecting lines between the data cards of all nodes associated with the node to which the data card belongs.

Further, the terminal can delete the node to which any data card displayed in the brain graph page belongs.

Specifically, if the terminal detects a deletion instruction for any one data card in the electroencephalogram page, the node to which the data card belongs is deleted in the target data, and then the above steps 102 to 104 are executed again.

The deleting instruction is used for indicating a node to which one data card in the target data belongs to be deleted. The deleting instruction can be triggered by a user, and the user can trigger the deleting instruction through operations such as click operation, sliding operation, voice operation, gesture operation and motion sensing operation, which is not limited in the embodiment of the application.

As an example, if the user moves a mouse and clicks a delete button in any one of the data cards displayed in the brain graph page, the terminal displays a delete confirmation window, and the user moves the mouse and clicks a confirmation option in the delete confirmation window to trigger a delete instruction. In response to the deletion instruction, the terminal deletes the node to which the data card belongs in the target data to update the target data, and then re-executes the steps 102 to 104 to draw the brain map of the updated target data.

Further, the terminal can also modify the data elements of the node to which any one of the data cards displayed in the brain graph page belongs.

Specifically, if the terminal detects a modification instruction for any one data card in the brain graph page, the data element of the node to which the data card belongs in the target data is modified into the data element carried by the modification instruction, and then the above steps 102 to 104 are executed again.

The modification instruction is used for indicating the data element of the node to which one data card in the modification target data belongs. The modification instruction can be triggered by a user, and the user can trigger the modification instruction through operations such as click operation, sliding operation, voice operation, gesture operation, somatosensory operation and the like, which is not limited in the embodiment of the application.

As an example, if the user moves a mouse and clicks a modification button in any one of the data cards displayed in the brain graph page, the terminal displays a modification confirmation window, and the user inputs a data element to be modified in the modification confirmation window and clicks a confirmation option to trigger a modification instruction. In response to the modification instruction, the terminal modifies the data elements of the nodes to which the data cards belong in the target data into the data elements carried by the modification instruction, so as to update the target data, and then re-executes the steps 102 to 104 to draw the brain graph of the updated target data.

Further, the terminal can add a new node to the node to which any data card displayed in the brain graph page belongs.

Specifically, if the terminal detects the node adding instruction in the brain graph page, a new node is added to the target data according to the node information carried by the node adding instruction, and the steps 102 to 104 are executed again to draw the brain graph of the updated target data.

The adding instruction is used for indicating that a new node is added in the target data, the adding instruction can be triggered by a user, and the user can trigger the adding instruction through operations such as click operation, sliding operation, voice operation, gesture operation and body sensing operation.

As an example, if the user moves a mouse and clicks an add button in a data card displayed in the brain graph page, the terminal displays an add confirmation window, and the user may input node information to be added in the add confirmation window and click a confirmation option to trigger a node add instruction. In response to the node adding instruction, the terminal adds a new node in the target data according to the node information to update the target data, and then re-executes the above steps 102 to 104 to draw an electroencephalogram of the updated target data.

Optionally, the technician may add some buttons with other functions to the data card as required to implement other interactive functions for each node.

It is to be noted that the brain graph drawing method provided in the embodiment of the present application is interactive with data cards as basic elements, so that the source tracing operation of the node to which each data card belongs can be implemented, and the interaction is fast and friendly. Moreover, the used technologies are all front-end basic technologies for technicians, so that the learning cost is low. In addition, due to the telescopic characteristic of svg, the drawn brain graph can be clearly displayed at any resolution.

For convenience of understanding, the brain mapping method is exemplified below with reference to fig. 16, taking company a as an initiator and company b as a participant, and cooperating with one data processing item.

Referring to fig. 16, the method includes steps 1601-1608 as follows.

Step 1601: the terminal acquires target data.

For example, the target data obtained by the terminal may be as shown in table 2 below:

TABLE 2

As shown in table 2 above, the target data has 4 hierarchies. The data processing project is initiated by a company A, participates in a company B, and both the company A and the company B participate in each link of the data processing project. The data processing items include data preprocessing 1 and data preprocessing 2. The data preprocessing 1 includes a feature engineering 1 and a feature engineering 2, that is, the data preprocessing 1 needs to be implemented by the feature engineering 1 and the feature engineering 2 to complete the work of the link. The data preprocessing 2 includes feature engineering 3, feature engineering 4 and feature engineering 5, that is, the completion of the data preprocessing 2 needs to be realized by the feature engineering 3, the feature engineering 4 and the feature engineering 5. The characteristic engineering 1 comprises a safety modeling 1, that is to say, to complete the work of the section of the characteristic engineering 1, the safety modeling 1 is required to realize the work. By analogy, the feature engineering 5 includes a safety modeling 5, and the safety modeling 5 is needed to complete the work of the feature engineering 5 in this link.

Step 1602: the terminal generates a data card for each of the 4 levels of nodes, the data card including controls for displaying and editing the data elements of the nodes.

Step 1603: the terminal determines 4 node regions in the brain graph page, which correspond to the 4 levels one by one.

Step 1604: and the terminal determines the data area of each node in the 4 th layer in the 4 th node area according to the ordering relation among the nodes in the 3 rd layer in the 4 th layer.

Step 1605: the terminal determines the data area of each node in the ith level in the 4 levels according to the data area of each node in the (i + 1) th level in the 4 levels and the ith node area in the 4 node areas.

For the data area of each node in the 3 rd level of the 4 levels, the data area of each node in the 3 rd level of the 4 levels is determined according to the data area of each node in the 4 th level of the 4 levels and the 3 rd node area in the 4 node areas.

For the data area of each node in the 2 nd level of the 4 levels, the data area of each node in the 2 nd level of the 4 levels is determined according to the data area of each node in the 3 rd level of the 4 levels and the 2 nd node area in the 4 node areas.

Step 1606: the terminal determines the data area of each node in the 1 st hierarchy in the 1 st node area of the 4 node areas.

Step 1607: the terminal displays the data card for each node in the data area of each node in the 4 levels.

Step 1608: and drawing connecting lines among the data cards of the nodes displayed in the brain graph page by the terminal according to the parent-child relationship among the nodes of the 4 levels.

And after the drawing of the connecting lines between the data cards of all the nodes displayed in the brain graph page is finished, obtaining the brain graph of the target data, namely finishing the drawing of the brain graph.

As shown in fig. 17, fig. 17 is a schematic view of a brain graph of target data. Fig. 17 includes 4 node regions 1701, data cards 1702 for respective nodes in the target data, and connection lines 1703 between the data cards for the respective nodes displayed in the brain map page. The 4 node regions 1701 are used for displaying data cards of nodes, the data cards 1702 of the respective nodes in the target data are used for displaying data elements of the respective nodes, and the connecting lines 1703 between the data cards of the respective nodes displayed in the brain graph page are used for representing the data flow direction between the respective nodes.

In the embodiment of the application, the terminal acquires target data, and the target data comprises n levels of nodes. And then generating a data card of each node in the n levels of nodes. And then displaying the data card of each node in the n levels of nodes in the brain graph page according to the ordering relation among the n levels of nodes, and drawing connecting lines among the data cards of all the nodes displayed in the brain graph page according to the parent-child relation among the n levels of nodes. Because the data cards of each node are controls for displaying and editing the data elements of the corresponding node, each data card can be triggered in a targeted manner, that is, when a user clicks any one data card, the terminal can directly know which data card is clicked, so that the terminal can know that the corresponding interactive operation is to be performed on the node to which the data card belongs, and the interaction is friendly. Moreover, for technicians, all technologies used in brain mapping are front-end basic technologies, and other frameworks do not need to be learned, so that the realization is simple.

Fig. 18 is a schematic structural diagram of an electroencephalogram rendering apparatus according to an embodiment of the present application. The brain mapping apparatus may be implemented by software, hardware or a combination of the two as part or all of a computer device, which may be the computer device shown in fig. 19 below. Referring to fig. 18, the apparatus includes: an obtaining module 1801, a generating module 1802, a first displaying module 1803, and a drawing module 1804.

An obtaining module 1801, configured to obtain target data, where the target data includes n levels of nodes, where a sequence of nodes in the n levels from a 1 st level to an nth level is a sequence from a root node to a leaf node, and n is an integer greater than or equal to 2;

a generating module 1802, configured to generate a data card for each node in the n levels of nodes, where the data card includes a control for displaying and editing data elements of the node;

a first display module 1803, configured to display, according to the sorting relationship among the n levels of nodes, a data card of each node in the n levels of nodes on the brain graph page;

a drawing module 1804, configured to draw connecting lines between the data cards of the nodes displayed in the brain graph page according to parent-child relationships between the nodes in the n levels.

Optionally, the apparatus further comprises:

a determining module, configured to determine, if a selection operation for an arbitrary data card is detected in the brain graph page, all nodes associated with a node to which one data card belongs among the n hierarchical nodes;

the second display module is used for highlighting the data cards of all nodes related to the node to which one data card belongs;

and the third display module is used for highlighting the connecting lines among the data cards of all the nodes related to the node to which one data card belongs.

Optionally, the apparatus further comprises:

a deleting module, configured to delete a node to which a data card belongs in the target data if a deletion instruction for an arbitrary data card is detected in the electroencephalogram page, and trigger the generating module 1802 to generate a data card for each node in the nodes of the n hierarchies.

Optionally, the apparatus further comprises:

and the modification module is used for modifying the data element of the node to which one data card in the target data belongs into the data element carried by the modification instruction if the modification instruction for any data card is detected in the brain graph page, and triggering the generation module 1802 to generate the data card of each node in the n levels of nodes.

Optionally, the apparatus further comprises:

and the adding module is used for adding a new node in the target data according to the node information carried by the node adding instruction if the node adding instruction is detected in the brain graph page, and triggering the generating module 1802 to generate the data card of each node in the nodes of the n layers.

In the embodiment of the application, target data is obtained, and the target data comprises n levels of nodes. And then generating a data card of each node in the n levels of nodes. And then displaying the data card of each node in the n levels of nodes in the brain graph page according to the ordering relation among the n levels of nodes, and drawing connecting lines among the data cards of all the nodes displayed in the brain graph page according to the parent-child relation among the n levels of nodes. Because the data cards of each node are controls for displaying and editing the data elements of the corresponding node, each data card can be triggered in a targeted manner, that is, when a user clicks any one data card, the device can directly know which data card is clicked, so that the user can know that the corresponding interactive operation is to be performed on the node to which the data card belongs, and the interaction is friendly. Moreover, for technicians, all technologies used in brain mapping are front-end basic technologies, and other frameworks do not need to be learned, so that the realization is simple.

It should be noted that: in the brain graph drawing apparatus provided in the above embodiment, when drawing the brain graph, only the division of the functional modules is exemplified, and in practical applications, the function distribution may be completed by different functional modules according to needs, that is, the internal structure of the apparatus is divided into different functional modules to complete all or part of the functions described above.

Each functional unit and module in the above embodiments may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit, and the integrated unit may be implemented in a form of hardware, or in a form of software functional unit. In addition, specific names of the functional units and modules are only used for distinguishing one functional unit from another, and are not used for limiting the protection scope of the embodiments of the present application.

The brain graph drawing device and the brain graph drawing method provided by the embodiment belong to the same concept, and the specific working processes of the units and modules and the technical effects brought by the units and the modules in the embodiment can be referred to the part of the embodiment of the method, and are not described herein again.

Fig. 19 is a schematic structural diagram of a computer device according to an embodiment of the present application. As shown in fig. 19, the computer device 19 includes: processor 190, memory 191 and computer program 192 stored in memory 191 and operable on processor 190, when processor 190 executes computer program 192, the steps in the brain mapping method in the above embodiments are implemented.

The computer device 19 may be a general purpose computer device or a special purpose computer device. In a specific implementation, the computer device 19 may be a desktop computer, a laptop computer, a palmtop computer, a mobile phone, a tablet computer, or the like, and the embodiment of the present application does not limit the type of the computer device 19. Those skilled in the art will appreciate that fig. 19 is merely an example of the computer device 19 and is not intended to limit the computer device 19 and may include more or less components than those shown, or some components may be combined, or different components may be included, such as input output devices, network access devices, etc.

Processor 190 may be a Central Processing Unit (CPU), and Processor 190 may also be another general purpose Processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), an off-the-shelf Programmable Gate Array (FPGA) or other Programmable logic device, discrete Gate or transistor logic, discrete hardware components, or the like. The general purpose processor may be a microprocessor or any conventional processor.

The memory 191 may be, in some embodiments, an internal storage unit of the computer device 19, such as a hard disk or memory of the computer device 19. The memory 191 may in other embodiments be an external storage device to the computer device 19, such as a plug-in hard drive, Smart Media Card (SMC), Secure Digital (SD) Card, Flash memory Card (Flash Card), etc. provided on the computer device 19. Further, the memory 191 may also include both internal storage units of the computer device 19 and external storage devices. The memory 191 is used for storing an operating system, application programs, a Boot Loader (Boot Loader), data, and other programs. The memory 191 may also be used to temporarily store data that has been output or is to be output.

An embodiment of the present application further provides a computer device, where the computer device includes: at least one processor, a memory, and a computer program stored in the memory and executable on the at least one processor, the processor implementing the steps of any of the various method embodiments described above when executing the computer program.

The embodiments of the present application also provide a computer-readable storage medium, where a computer program is stored, and when the computer program is executed by a processor, the steps in the above-mentioned method embodiments can be implemented.

The embodiments of the present application provide a computer program product, which when run on a computer causes the computer to perform the steps of the above-described method embodiments.

The integrated unit, if implemented in the form of a software functional unit and sold or used as a separate product, may be stored in a computer readable storage medium. Based on such understanding, all or part of the processes in the above method embodiments may be implemented by a computer program, which may be stored in a computer readable storage medium and used by a processor to implement the steps of the above method embodiments. Wherein the computer program comprises computer program code, which may be in the form of source code, object code, an executable file or some intermediate form, etc. The computer readable medium may include at least: any entity or apparatus capable of carrying computer program code to a photographing apparatus/terminal device, a recording medium, computer Memory, ROM (Read-Only Memory), RAM (Random Access Memory), CD-ROM (Compact Disc Read-Only Memory), magnetic tape, floppy disk, optical data storage device, etc. The computer-readable storage medium referred to herein may be a non-volatile storage medium, in other words, a non-transitory storage medium.

It should be understood that all or part of the steps for implementing the above embodiments may be implemented by software, hardware, firmware or any combination thereof. When implemented in software, may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. The computer instructions may be stored in the computer-readable storage medium described above.

In the above embodiments, the descriptions of the respective embodiments have respective emphasis, and reference may be made to the related descriptions of other embodiments for parts that are not described or illustrated in a certain embodiment.

Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.

The above embodiments are only used to illustrate the technical solutions of the present application, and not to limit the same; although the present application has been described in detail with reference to the foregoing embodiments, it should be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; such modifications and substitutions do not depart from the spirit and scope of the embodiments of the present application, and they should be construed as being included in the present application.

Claims

1. A brain mapping method, the method comprising:

2. The method of claim 1, wherein said displaying a data card for each of said n levels of nodes on a brain graph page according to an ordering relationship between said n levels of nodes comprises:

determining n node regions corresponding to the n levels one by one in the brain graph page;

determining a data area of each node in the nth level in the nth node area according to the ordering relation among all nodes in the (n-1) th level in the n levels;

determining a data area of each node in the ith level in the n levels according to the data area of each node in the (i + 1) th level in the n levels and the ith node area in the n node areas, wherein i is an integer which is greater than or equal to 2 and less than or equal to n-1;

determining a data area of each node in the 1 st hierarchy in the 1 st node area of the n node areas;

and displaying the data card of each node in the data area of each node in the n layers.

3. The method of claim 2, wherein said determining a data region for each node in said nth hierarchy in an nth node region of said n node regions based on an ordering relationship between respective nodes in an n-1 th hierarchy of said n hierarchies comprises:

for a first node in the nth level, determining a display distance value corresponding to a first node in the nth level according to the sorting position of a parent node of the first node in the nth level in the node in the (n-1) th level, and determining a data area which is away from a target boundary of the nth node area by the display distance value corresponding to the first node in the nth level as a data area of the first node in the nth level;

for a first target node in the nth hierarchy, the first target node is any node except the first node in the nth hierarchy, a second target node is a previous node adjacent to the first target node in the nth hierarchy, a display distance value corresponding to the first target node is determined according to a difference in ranking position between a parent node of the first target node and a parent node of the second target node and a display distance value corresponding to the second target node, and a data area which is distant from a target boundary of the nth node area by the display distance value corresponding to the first target node is determined as a data area of the first target node.

4. The method of claim 3, wherein the width of the data card is a first predetermined width; the determining, according to the ranking position of the parent node of the first node in the nth hierarchy in the node in the (n-1) th hierarchy, the display distance value corresponding to the first node in the nth hierarchy includes:

if the father node of the first node in the nth level is the jth node in the nth-1 level, accumulating a first preset interval value, a second preset interval value which is j-1 times of the first preset interval value and a first preset width which is j-1 times of the first preset width to obtain a display distance value corresponding to the first node in the nth level, wherein j is a positive integer; alternatively, the first and second electrodes may be,

if the parent node of the first node in the nth level is the jth node in the nth-1 level, accumulating a first preset interval value, a j-1 times second preset interval value and a j-1 times first preset width to obtain a display distance value corresponding to the first node in the nth level when the parent nodes of the first jth node in the nth-1 level are the same node, accumulating the first preset interval value, the j-m times second preset interval value, the m-1 times third preset interval value and the j-1 times first preset width to obtain a display distance value corresponding to the first node in the nth level when the parent nodes of the first jth node in the nth-1 level are m different nodes, wherein m is an integer greater than or equal to 2, the third preset interval value is greater than the second preset interval value.

5. The method of claim 3, wherein the width of the data card is a first predetermined width; determining a display distance value corresponding to the first target node according to the sorting position difference between the parent node of the first target node and the parent node of the second target node and the display distance value corresponding to the second target node, including:

if k nodes are spaced between the father node of the first target node and the father node of the second target node, accumulating the display distance value corresponding to the second target node, a second preset spacing value which is k +1 times, and a first preset width which is k +1 times to obtain a display distance value corresponding to the first target node, wherein k is an integer which is greater than or equal to 0; alternatively, the first and second electrodes may be,

if k nodes are spaced between the father node of the first target node and the father node of the second target node, accumulating the display distance value corresponding to the second target node, k +1 times of a second preset interval value and k +1 times of a first preset width to obtain a display distance value corresponding to the first target node under the condition that the grandfather node of the first target node and the grandfather node of the second target node are the same node, accumulating the display distance value corresponding to the second target node, k-p +2 times of a second preset interval value, p-1 times of a third preset interval value and k +1 times of the first preset width to obtain a display distance value corresponding to the first target node under the condition that the grandfather node of the first target node and the grandfather node of the second target node are p different nodes, and p is an integer greater than or equal to 2, and the third preset interval value is greater than the second preset interval value.

6. The method of claim 3, wherein said determining the data area for each node in the ith level of said n levels based on the data area for each node in the (i + 1) th level of said n levels at the ith node area of said n node areas comprises:

for a jth node in the ith level, if a child node exists in the jth node in the ith level, determining a display distance value corresponding to a first child node of the jth node in the ith level as a display distance value corresponding to the jth node in the ith level, wherein j is a positive integer;

adding the sum of the widths of the data areas of all the sub-nodes of the jth node in the ith hierarchy to the sum of the interval values between the data areas of all the adjacent two sub-nodes of the jth node in the ith hierarchy to obtain the display width corresponding to the jth node in the ith hierarchy;

and determining a data area which is away from the target boundary of the ith node area by the display distance value corresponding to the jth node in the ith hierarchy and has the width of the display width corresponding to the jth node in the ith hierarchy as the data area of the jth node in the ith hierarchy.

7. The method of claim 3, wherein said drawing connecting lines between data cards for respective nodes displayed in said brain graph page according to parent-child relationships between said n levels of nodes comprises:

for any two nodes with a parent-child relationship in the n levels of nodes, determining a connecting line endpoint corresponding to each node in the two nodes according to a data area where data cards of the two nodes are located in the brain graph page;

and drawing a connecting line between the data cards of the two nodes according to the connecting line end point corresponding to each node in the two nodes.

8. The method of claim 7, wherein the determining the connecting line end point corresponding to each of the two nodes according to the data area where the data cards of the two nodes are located in the brain graph page comprises:

for any node in the two nodes, adding a numerical value obtained by multiplying the width of a data area where the data card of the node is located in the brain graph page by t and a display distance value corresponding to the node to obtain a target distance value, wherein the t is greater than 0 and less than 1;

and determining a position point, which is in the data area where the data card of the node is located and is away from the target boundary of the node area where the data card of the node is located by the target distance value, as the connecting line end point corresponding to the node.

9. The method of claim 7, wherein said drawing a connection line between data cards of said two nodes according to a connection line endpoint corresponding to each of said two nodes comprises:

if the father node of the two nodes is the node of the ith level, determining a first reference line in an interval area between the ith node area and the (i + 1) th node area, wherein the first reference line is vertical to a straight line where a target boundary of the ith node area and a target boundary of the (i + 1) th node area are located;

determining a first position point which is away from a straight line where a target boundary of the ith node region is located by a first distance value in the first reference line, wherein the first distance value is a distance value between a connecting line end point corresponding to a parent node of the two nodes and the target boundary of the ith node region;

determining a second position point which is away from a straight line where a target boundary of the (i + 1) th node region is located by a second distance value in the first reference line, wherein the second distance value is a distance value between a connecting line end point corresponding to a sub-node of the two nodes and the target boundary of the (i + 1) th node region;

and sequentially drawing lines among the connecting line end points corresponding to the father nodes in the two nodes, the first position point, the second position point and the connecting line end points corresponding to the son nodes in the two nodes to obtain the connecting line between the data cards of the two nodes.

10. The method of claim 7, wherein said drawing a connection line between data cards of said two nodes according to a connection line endpoint corresponding to each of said two nodes comprises:

if a parent node of the two nodes is the node of the 1 st level, determining a second reference line and a third reference line in a spacing area between the 1 st node area and a 2 nd node area of the n node areas under the condition that the 1 st level comprises a plurality of nodes, wherein the second reference line and the third reference line are both vertical to a straight line where a target boundary of the 1 st node area and a target boundary of the 2 nd node area are located, and the second reference line is located between the 1 st node area and the third reference line;

determining a third position point which is away from the straight line where the target boundary of the 1 st node region is located by a third distance value in the second reference line, wherein the third distance value is the distance value between the end point of the connecting line corresponding to the parent node of the two nodes and the target boundary of the 1 st node region;

determining a fourth position point which is away from the straight line where the target boundary of the 2 nd node region is located by a fourth distance value in the third reference line, wherein the fourth distance value is the distance value between the end point of the connecting line corresponding to the sub-node of the two nodes and the target boundary of the 2 nd node region;

adding the sum of the widths of the data areas of the plurality of nodes in the 1 st level and the sum of the interval values between the data areas of all the adjacent two nodes in the plurality of nodes in the 1 st level to obtain a target numerical value; adding a numerical value obtained by dividing the target numerical value by 2 to a display distance value corresponding to a first node in the 1 st level to obtain a fifth distance value;

determining a fifth position point which is away from a straight line where a target boundary of the 1 st node region is located by a fifth distance value in the second reference line, and determining a sixth position point which is away from a straight line where a target boundary of the 2 nd node region is located by a fifth distance value in the third reference line;

and sequentially drawing lines among the connecting line end points corresponding to the father node, the third position point, the fifth position point, the sixth position point, the fourth position point and the connecting line end points corresponding to the son nodes of the two nodes to obtain the connecting line between the data cards of the two nodes.

11. The method according to any one of claims 1-10, wherein after drawing the connecting lines between the data cards of the respective nodes displayed in the brain graph page according to the parent-child relationship between the n levels of nodes, further comprising:

if the selection operation of any one data card is detected in the brain graph page, determining all nodes related to the node to which the data card belongs in the n levels of nodes; highlighting the data cards of all nodes associated with the node to which the data card belongs; highlighting the connecting lines between the data cards of all nodes related to the node to which the data card belongs;

and/or the presence of a gas in the gas,

after the connecting lines between the data cards of the nodes displayed in the brain graph page are drawn according to the parent-child relationship among the nodes of the n layers, the method further includes:

if a deletion instruction for any one data card is detected in the brain graph page, deleting the node to which the data card belongs in the target data, and re-executing the step of generating the data card of each node in the n levels of nodes and the subsequent steps;

and/or the presence of a gas in the gas,

if a modification instruction for any one data card is detected in the brain graph page, modifying the data element of the node to which the data card belongs in the target data into the data element carried by the modification instruction, and re-executing the step of generating the data card of each node in the n levels of nodes and the subsequent steps;

and/or the presence of a gas in the atmosphere,

and if a node adding instruction is detected in the brain graph page, adding a new node in the target data according to node information carried by the node adding instruction, and re-executing the step of generating the data card of each node in the n levels of nodes and the subsequent steps.

12. The method of claim 11, wherein highlighting the connecting lines between data cards of all nodes associated with the node to which said one data card belongs comprises:

and redrawing the connecting lines among the data cards of all the nodes related to the node to which the data card belongs according to the parent-child relationship among all the nodes related to the node to which the data card belongs, and highlighting the redrawing connecting lines.

13. An electroencephalogram rendering apparatus, characterized in that the apparatus comprises:

14. A computer device, characterized in that the computer device comprises a memory, a processor and a computer program stored in the memory and executable on the processor, which computer program, when executed by the processor, implements the method according to any of claims 1 to 12.

15. A computer-readable storage medium, characterized in that the computer-readable storage medium stores a computer program which, when executed by a processor, implements the method of any one of claims 1 to 12.