Data processing method and device, electronic equipment and storage medium
By providing data processing methods in the game, determining the controllable number of target tree nodes in the tree hierarchical topology diagram, the problem of difficulty in expanding the tree structure is solved, the processing efficiency and expected accuracy are improved, and the trial and error cost is reduced .
Patent Information
- Application Number
- CN202310640719.0
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2023-05-31
- Publication Date
- 2024-12-03
AI Technical Summary
In games, the expansion of the tree structure is limited by the terminal screen size, which makes it difficult for the demand side to expect whether the new tree branch can be realized, resulting in too high design attempt time and trial and error costs.
Provide a data processing method, by receiving new requests from nodes, determine the number of controllable bits of the target tree node under the preset layout mode of the tree-like topology diagram, and characterize the placement of the next-level tree node expanded from the target tree node. and provide feedback results based on the controllable number of bits, reducing the cost of trial and error of the feasibility of the scheme and improving processing efficiency.
This method can estimate the ductility of the tree-level topology map, reduce the cost of trial and error on the feasibility of the solution, improve processing efficiency, help the demand side to expect the implementation of demand in advance, and reduce the communication costs with downstream vision.
Smart Images

Figure CN119066229A_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the field of computer application technology, and in particular to a data processing method, device, electronic device and storage medium. Background Art
[0002] In games, a certain gameplay is often displayed in a tree structure, for example, the technology tree, talent tree, weapon tree, item tree, etc.
[0003] Taking the technology tree as an example, when there is a demand to add new tree branches to the technology tree, due to the limitation of the size of the terminal screen, the expected extension is difficult to estimate, resulting in the demander having no expectation of whether the demand can be met.
[0004] At present, in response to the above requirements, downstream visual solutions are usually required to be manually tried, resulting in excessive time and trial-and-error costs for design attempts. Summary of the invention
[0005] In view of this, the embodiments of the present application at least provide a data processing method, device, electronic device and storage medium to improve the processing efficiency for the tree-like hierarchical topology structure.
[0006] In a first aspect, an exemplary embodiment of the present application provides a data processing method, the method comprising: receiving a node addition request, the node addition request being used to indicate creation of a new branch under a target tree node in a tree-like hierarchical topology graph; determining the number of following controllable bits of the target tree node under a preset layout of the tree-like hierarchical topology graph, the following controllable bits representing placement positions of next-level tree nodes extending from the target tree node; and providing feedback results for the node addition request based on the determined number of following controllable bits.
[0007] In a second aspect, an embodiment of the present application also provides a data processing device, which includes: a request receiving module, which receives a node addition request, and the node addition request is used to indicate the creation of a new branch under a target tree node in a tree-like hierarchical topology diagram; a controllable position determination module, which determines the number of the following controllable positions of the target tree node under a preset layout of the tree-like hierarchical topology diagram, and the following controllable positions represent the placement positions of the next-level tree nodes extended from the target tree node; and a feedback providing module, which provides feedback results for the node addition request based on the determined number of the following controllable positions.
[0008] In a third aspect, an embodiment of the present application further provides an electronic device, a processor, a storage medium and a bus, wherein the storage medium stores machine-readable instructions executable by the processor. When the electronic device is running, the processor and the storage medium communicate through the bus, and the processor executes the machine-readable instructions to perform the steps of the above method.
[0009] In a fourth aspect, an embodiment of the present application further provides a computer-readable storage medium, on which a computer program is stored, and when the computer program is executed by a processor, the steps of the above method are executed.
[0010] The data processing method, device, electronic device and storage medium provided in the embodiments of the present application can reduce the cost of trial and error of the feasibility of the solution and improve processing efficiency.
[0011] In order to make the above-mentioned objects, features and advantages of the present application more obvious and easy to understand, preferred embodiments are specifically cited below and described in detail with reference to the attached drawings. BRIEF DESCRIPTION OF THE DRAWINGS
[0012] In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings required for use in the embodiments will be briefly introduced below. It should be understood that the following drawings only show certain embodiments of the present application and therefore should not be regarded as limiting the scope. For ordinary technicians in this field, other related drawings can be obtained based on these drawings without paying creative work.
[0013] Figure 1 A schematic diagram showing adding a new tree branch in a tree structure;
[0014] Figure 2 A flow chart showing a data processing method provided by an exemplary embodiment of the present application;
[0015] Figure 3 One of the schematic diagrams showing the preset layout of the tree-like hierarchical topology diagram provided by the exemplary embodiment of the present application;
[0016] Figure 4 A second schematic diagram showing a preset layout of a tree-like hierarchical topology diagram provided by an exemplary embodiment of the present application;
[0017] Figure 5 A third schematic diagram showing a preset layout of a tree-like hierarchical topology diagram provided by an exemplary embodiment of the present application;
[0018] Figure 6 A flowchart showing steps for adjusting the placement position of a target tree node provided by an exemplary embodiment of the present application;
[0019] Figure 7 A schematic diagram showing the structure of a data processing device provided by an exemplary embodiment of the present application is shown;
[0020] Figure 8 A schematic diagram of the structure of an electronic device provided by an exemplary embodiment of the present application is shown. DETAILED DESCRIPTION
[0021] To make the purpose, technical scheme and advantages of the embodiments of the present application clearer, the technical scheme in the embodiments of the present application will be clearly and completely described below in conjunction with the drawings in the embodiments of the present application. It should be understood that the drawings in the present application only serve the purpose of explanation and description and are not used to limit the scope of protection of the present application. In addition, it should be understood that the schematic drawings are not drawn in real proportion. The flowchart used in this application shows the operations implemented according to some embodiments of the present application. It should be understood that the operations of the flowchart can be implemented out of sequence, and the steps without logical context can be reversed in order or implemented simultaneously. In addition, those skilled in the art, under the guidance of the content of the present application, can add one or more other operations to the flowchart, or remove one or more operations from the flowchart.
[0022] The terms "a", "an", "the" and "said" are used in this specification to indicate the presence of one or more elements / components / etc.; the terms "including" and "having" are used to express an open-ended inclusion and mean that additional elements / components / etc. may exist in addition to the listed elements / components / etc.; the terms "first" and "second" etc. are used only as labels and are not intended to limit the quantity of their objects.
[0023] It should be understood that in the embodiments of the present application, "at least one" refers to one or more, and "more than one" refers to two or more. "And / or" is merely a way to describe the association relationship of associated objects, indicating that three relationships may exist. For example, A and / or B can represent: A exists alone, A and B exist at the same time, and B exists alone. The character " / " generally indicates that the previous and subsequent associated objects are in an "or" relationship. "Including A, B and / or C" means including any one, any two, or any three of A, B, and C.
[0024] It should be understood that in the embodiments of the present application, "B corresponding to A", "B corresponding to A", "A corresponds to B", or "B corresponds to A" means that B is associated with A, and B can be determined according to A. Determining B according to A does not mean determining B only according to A, and B can also be determined according to A and / or other information.
[0025] In addition, the described embodiments are only a part of the embodiments of the present application, rather than all the embodiments. The components of the embodiments of the present application described and shown in the drawings here can be arranged and designed in various configurations. Therefore, the following detailed description of the embodiments of the present application provided in the drawings is not intended to limit the scope of the application claimed for protection, but merely represents the selected embodiments of the present application. Based on the embodiments of the present application, all other embodiments obtained by those skilled in the art without making creative work belong to the scope of protection of the present application.
[0026] At present, the topological relationship of multiple nodes is often displayed in the form of a tree structure, and the nodes are connected by tree-like lines. The display interface of the tree structure is relatively complex. When there is a demand to add new tree branches to the tree structure, it is difficult to estimate the expected extension due to the size of the terminal device screen, resulting in the demander having no expectation of whether the demand can be realized.
[0027] See also Figure 1 As shown, a tree structure (e.g., a tree formed by nodes A0 to A4) has been constructed in the canvas 10. When it is necessary to add new tree branches (A5 to A6) to the tree structure, it is usually necessary for the downstream visual system to manually try out the solution, resulting in excessive time cost and trial-and-error cost for design attempts.
[0028] In response to the above problems, the present application proposes a data processing method, device, electronic device and storage medium, which can estimate the scalability of the tree-like hierarchical topology diagram, reduce the cost of trial and error of the feasibility of the solution, and improve processing efficiency.
[0029] First, the names involved in the embodiments of the present application are briefly introduced.
[0030] In the embodiment of the present application, a graphical user interface may be provided by a terminal device, and a tree-like hierarchical topology diagram may also be displayed in the graphical user interface, wherein:
[0031] Terminal equipment:
[0032] The terminal device involved in the embodiments of the present application mainly refers to an intelligent device used to provide a game interface (such as a relevant setting / configuration interface in the game, an interface for presenting a game scene), and capable of controlling and operating a virtual character. The terminal device may include, but is not limited to, any one of the following devices: a smart phone, a tablet computer, a portable computer, a desktop computer, a game console, a personal digital assistant (PDA), an e-book reader, an MP4 (Moving Picture Experts Group Audio Layer IV, dynamic image expert compression standard audio layer 4) player, etc. The terminal device is installed and running with an application that supports game scenes, such as an application that supports three-dimensional game scenes. The application may include, but is not limited to, any one of a virtual reality application, a three-dimensional map program, a military simulation program, a MOBA game, a multiplayer gunfight survival game, and a third-person shooting game (TPS, Third-Personal Shooting Game). Optionally, the application may be a stand-alone application, such as a stand-alone 3D game program, or a network-connected application.
[0033] Graphical User Interface:
[0034] It is an interface display format for communication between people and computers, allowing users to manipulate icons, logos or menu options on the screen using input devices such as a mouse or keyboard, and also allowing users to manipulate icons or menu options on the screen by performing touch operations on the touch screen of a touch terminal to select commands, start programs or perform other tasks.
[0035] Game scene:
[0036] It is a virtual scene displayed (or provided) when the application is running on a terminal or server. Optionally, the virtual game is a simulation environment of the real world, or a semi-simulation and semi-fictional virtual environment, or a purely fictional virtual environment. The virtual scene is any one of a two-dimensional virtual scene and a three-dimensional virtual scene. The virtual environment can be the sky, land, ocean, etc., wherein the land includes environmental elements such as deserts and cities. Among them, the game scene is a scene where the user controls the complete game logic of the virtual character.
[0037] Virtual Characters:
[0038] Refers to a virtual character in a virtual environment, which may be a virtual character controlled by a player, including but not limited to at least one of a virtual person, a virtual animal, and an animated character, and may also be a virtual character (NPC) controlled by a non-player. Optionally, when the virtual environment is a three-dimensional virtual environment, the virtual character may be a three-dimensional virtual model, and each virtual character has its own shape and volume in the three-dimensional virtual environment, occupying a portion of the space in the three-dimensional virtual environment. Optionally, the virtual character is a three-dimensional character constructed based on three-dimensional human skeleton technology, and the virtual character achieves different external images by wearing different skins. In some implementations, the virtual character may also be implemented using a 2.5-dimensional or 2-dimensional model, which is not limited in the embodiments of the present application.
[0039] There may be multiple virtual characters in a virtual scene, which are virtual characters controlled by players (i.e., characters controlled by players through input devices), or artificial intelligence (AI) set in a virtual environment through training. Optionally, the virtual character is a virtual person competing in a game scene. Optionally, the number of virtual characters in the game scene battle is preset, or dynamically determined according to the number of terminal devices joining the virtual game, which is not limited in the embodiments of the present application. In one possible implementation, the user can control the virtual character to move in the virtual scene, for example, control the virtual character to run, jump, crawl, etc., and can also control the virtual character to use the virtual skills, virtual props, etc. provided by the application to fight with other virtual characters.
[0040] In an optional embodiment, the terminal device may be a local terminal device. Taking a game as an example, the local terminal device stores a game program and is used to present a game screen. The local terminal device is used to interact with the player through a graphical user interface, that is, the game program is downloaded and installed and run by a conventional electronic device. The local terminal device may provide the graphical user interface to the player in a variety of ways, for example, it may be rendered and displayed on a display screen of the terminal device, or provided to the player through a holographic projection. For example, the local terminal device may include a display screen and a processor, the display screen is used to present a graphical user interface, the graphical user interface includes a game scene screen, and the processor is used to run the game, generate a graphical user interface, and control the display of the graphical user interface on the display screen.
[0041] The application scenarios to which the present application is applicable are introduced. The present application can be applied to the field of game technology, in which multiple players participating in the game join the same virtual game.
[0042] Before entering the virtual game, the player can select different role attributes for his virtual character in the virtual game, such as identity attributes, and by assigning different role attributes to determine different camps, the player can win the game by performing the tasks assigned by the game at different stages of the virtual game. For example, multiple virtual characters with role attribute A can "eliminate" virtual characters with role attribute B in the game stage to win the game. Here, role attributes can also be randomly assigned to each virtual character participating in the virtual game when entering the virtual game.
[0043] The implementation environment provided in one embodiment of the present application may include: a first terminal device, a server, and a second terminal device. The first terminal device and the second terminal device communicate with the server respectively to achieve data communication. In this embodiment, the first terminal device and the second terminal device are respectively installed with an application program that executes the interactive processing method in the game provided by the present application, and the server is a server end that executes the interactive processing method in the game provided by the present application. Through the application program, the first terminal device and the second terminal device can communicate with the server respectively.
[0044] Taking the first terminal device as an example, the first terminal device establishes communication with the server by running an application. In an optional embodiment, the server establishes a virtual game according to the game request of the application. Among them, the parameters of the virtual game can be determined according to the parameters in the received game request. For example, the parameters of the virtual game may include the number of people participating in the virtual game, the level of the characters participating in the virtual game, etc. When the first terminal device receives the response of the game server, the game scene corresponding to the virtual game is displayed through the graphical user interface of the first terminal device. The first terminal device is a device controlled by the first user. The virtual character displayed in the graphical user interface of the first terminal device is the player character controlled by the first user (i.e., the first virtual character). The first user inputs operation instructions through the graphical user interface to control the player character to perform corresponding operations in the game scene.
[0045] Taking the second terminal device as an example, the second terminal device establishes communication with the server by running an application. In an optional embodiment, the server establishes a virtual game according to the game request of the application. Among them, the parameters of the virtual game can be determined according to the parameters in the received game request. For example, the parameters of the virtual game may include the number of people participating in the virtual game, the level of the characters participating in the virtual game, etc. When the second terminal device receives the response from the server, the game scene corresponding to the virtual game is displayed through the graphical user interface of the second terminal device. The second terminal device is a device controlled by the second user, and the virtual character displayed in the graphical user interface of the second terminal device is the player character controlled by the second user (i.e., the second virtual character). The second user inputs operation instructions through the graphical user interface to control the player character to perform corresponding operations in the virtual scene.
[0046] The server performs data calculation based on the game data reported by the first terminal device and the second terminal device, and synchronizes the calculated game data to the first terminal device and the second terminal device, so that the first terminal device and the second terminal device control the graphical user interface to render the corresponding game scene and / or virtual character according to the synchronization data sent by the game server.
[0047] In this embodiment, the first virtual character controlled by the first terminal device and the second virtual character controlled by the second terminal device are virtual characters in the same virtual game. The first virtual character controlled by the first terminal device and the second virtual character controlled by the second terminal device may have the same character attributes or different character attributes, and the first virtual character controlled by the first terminal device and the second virtual character controlled by the second terminal device belong to the same camp.
[0048] It should be noted that a virtual game may include two or more virtual characters, and different virtual characters may correspond to different terminal devices. That is to say, in a virtual game, there are more than two terminal devices that send and synchronize game data with the game server respectively.
[0049] To facilitate understanding of the present application, the data processing method, device, electronic device and storage medium provided in the embodiments of the present application are described in detail below.
[0050] See also Figure 2 , is a flow chart of a data processing method provided by an exemplary embodiment of the present application, and the data processing method specifically includes:
[0051] Step S101: receiving a node adding request.
[0052] Here, the node addition request is used to indicate the creation of a new branch under the target tree node of the tree-like hierarchical topology diagram. Exemplarily, the node addition request may carry a node identifier, a tree identifier, and a hierarchy identifier. The node identifier is used to indicate the target tree node that has a direct hierarchical subordinate relationship with the requested new branch, that is, the parent tree node of the new branch. The tree identifier is used to indicate the tree-like hierarchical topology diagram to which the target tree node belongs. The hierarchy identifier may also be a sequence identifier, which is used to indicate the hierarchy of the target tree node in the tree-like hierarchical topology diagram.
[0053] In an embodiment of the present application, a tree-like hierarchical topology diagram may include multiple tree nodes and multiple edges. There are hierarchies between the tree nodes (there may also be a nested relationship). The tree-like hierarchical topology diagram is displayed and processed according to the hierarchical relationship of each tree node. For example, two tree nodes with a hierarchical subordinate relationship can be connected by an edge.
[0054] Usually, there is at least one strategy tree in the game, each strategy tree has at least one fork, each fork has at least one tree node, tree nodes with associated relationships are connected by lines, and there can be a hierarchical (sequence) relationship between two tree nodes connected by lines.
[0055] Exemplarily, each tree node in the strategy tree may correspond to a virtual element in the game scene, and the state of the game world may be changed by operating the virtual element.
[0056] As an example, the strategy tree may include but is not limited to: technology tree, talent tree, weapon tree, prop tree, building tree (which may refer to the tree structure used to create buildings in the game scene, not the virtual trees in the game scene), etc. In other words, the technology, weapons, props, etc. in the game can all be presented in the form of a tree-like hierarchical topology diagram. By operating the tree nodes in the tree-like hierarchical topology diagram, the virtual elements corresponding to the operated nodes can be applied in the game scene to change the state of the game world.
[0057] In an embodiment of the present application, a node addition request may be received in at least one of the following ways.
[0058] In the first embodiment, a node adding request is received according to a triggering operation on a target tree node of a tree-like hierarchical topology diagram displayed on a graphical user interface.
[0059] Exemplarily, the trigger operation may refer to an operation for triggering the creation of a new branch, for example, may include but is not limited to: a long press operation on a target tree node, a double click operation on a target tree node, a sliding operation performed on a graphical user interface.
[0060] In the second embodiment, a node adding request is received according to an input operation for creating a new branch.
[0061] For example, a requirement interface can be provided through a graphical user interface, which includes at least one input box (or an input option), and the at least one input box corresponds to the information required to be carried in the above-mentioned node addition request. Exemplarily, it can include a node input box for determining a target tree node, a tree input box for determining a tree hierarchical topology diagram, a level input box for determining the level of the target tree node, and so on.
[0062] In a preferred embodiment of the present application, the above data processing method can be executed by the terminal device of the product demander, so that there is no need to wait for feedback from the downstream visual side, so that the product demander can have an advance expectation of whether the demand can be realized, improve the processing efficiency of the product side, and facilitate the product demander to re-plan the demand. In the above manner, the product demander can realize self-verification without waiting for feedback from the downstream visual side.
[0063] In this case, the terminal device of the product demander can receive the node addition request through the methods of the above two embodiments.
[0064] However, the present application is not limited thereto. In another preferred embodiment, the data processing method can also be performed by a terminal device on the downstream visual side, so that there is no need to manually try to place a solution, which helps to improve work efficiency. In addition, the number of usable ranges can be directly calculated to reduce the communication cost with the product.
[0065] In this case, the terminal device on the downstream visual side can receive a node addition request from the product demander.
[0066] Here, it can be realized with the help of various devices / tools. For example, a node addition request can be obtained from the product demander via a terminal device, a demand report, an electronic storage medium (such as a USB flash drive), etc.
[0067] Step S102: Determine the number of the following controllable bits of the target tree node in the preset layout mode of the tree-like hierarchical topology diagram. Here, the following controllable bits are used to represent the placement position of the next level tree node extended from the target tree node.
[0068] In an embodiment of the present application, layout constraints are set for the placement of each tree node in the tree-like hierarchical topology diagram, that is, each tree node is arranged under constraints in terms of arrangement and / or node size to form a tree-like hierarchical topology diagram.
[0069] Exemplarily, the preset layout method includes a node arrangement method for indicating the arrangement layout of each tree node in the tree-like hierarchical topology diagram and / or a node size configuration for indicating the display size of each tree node.
[0070] Regarding the node arrangement method, the node arrangement method in the embodiments of the present application includes but is not limited to at least one of the following methods.
[0071] In the first arrangement mode, all tree nodes are arranged within the specified canvas range.
[0072] Here, the designated canvas range is formed by two straight lines emitted from a source tree node of the tree-like hierarchical topology graph. The source tree node is the starting node of the tree-like hierarchical topology graph, and may also be referred to as a root node.
[0073] Combine the following Figure 3 To illustrate the first arrangement mentioned above.
[0074] Figure 3 One of the schematic diagrams showing the preset layout of the tree-like hierarchical topology diagram provided by the exemplary embodiment of the present application.
[0075] like Figure 3 As shown, in the embodiment of the present application, the tree-like hierarchical topology diagram is a tree-like diagram for a single quadrant. In this example, the display area occupied by each tree node in the canvas 20 is a rectangle as an example for introduction, and a vertex of the display area occupied by the initial bifurcation point N0 (source tree node) is used as the origin of the quadrant. The tree-like branches extending from the initial bifurcation point N0 will not exceed the two sides of the quadrant. Figure 3 In the example shown, it is equivalent to arranging the tree nodes in the third quadrant.
[0076] The above-mentioned canvas 20 can be a canvas displayed in the editing / design stage of the tree-like hierarchical topology map. After the tree-like hierarchical topology map is constructed, it is generally displayed through a terminal device. Therefore, the extension direction of the tree-like hierarchical topology map can be kept consistent with the border direction of the terminal device. For example, starting from the initial bifurcation point N0, the tree-like hierarchical topology map is expanded in the horizontal and vertical extension directions.
[0077] In the second arrangement, for each tree node, multiple controllable bits of the tree node are placed around the tree node, and the adjacent sides of the controllable bits adjacent to the placement position of the tree node overlap, and the adjacent sides of two controllable bits adjacent to the placement position also overlap.
[0078] Each tree node has a hierarchical relationship, and the display size of tree nodes at different levels can be pre-set. Figure 3 In the example shown, tree nodes N1 to N5 are tree nodes of the next level of source tree node N0, and the display size of source tree node N0 (the area shown by the horizontal line shadow in the figure) can be larger than the display size of tree nodes N1 to N5 (the area shown by the diagonal line shadow in the figure).
[0079] In the tree-like hierarchical topology diagram, the bifurcation point of the first level is the source tree node N0. Since it can be extended in only two directions, based on the display size, arrangement method and slot size of each tree node, as shown in the figure, using the enumeration method, the source tree node N0 can have 5 following controllable bits 1 to 5 and a maximum of 4 following slots 1 to 4.
[0080] Here, the upper slot may refer to the crown point slot linking the previous level bifurcation point, the lower slot may refer to the crown point slot of the next level bifurcation point that the current tree node can expand, and the lower controllable position may refer to the placement position (coordinate position) where the next level tree node can be placed.
[0081] As shown in the figure, the display areas of the tree nodes do not overlap, but the adjacent edges overlap, so that the arrangement of the tree nodes can be compact to obtain the minimum utilization space (minimum occupied area) of the tree-like hierarchical topology diagram.
[0082] Figure 4 A second schematic diagram showing a preset layout of a tree-like hierarchical topology diagram provided by an exemplary embodiment of the present application.
[0083] like Figure 4 As shown, for non-source tree nodes, there are four directions in which they can be extended in the extreme case within the range of canvas 20 (e.g., tree node N2), and there are at most 7 lower controllable bits (N21 to N27 shown in the square) and 1 upper row bit N0 to the next level, for a total of 8 controllable bits, at most 5 lower row slots, and there must be 1 upper row slot.
[0084] If the display size and / or slot size of each tree node changes, the corresponding number of controllable positions and the number of crown point slots will change accordingly.
[0085] Regarding the node size configuration, the node size configuration in the embodiment of the present application includes the size of the display area corresponding to each controllable position. Exemplarily, at least one of the following items is displayed in each display area: a node icon used to characterize the function of the corresponding tree node, text information used to describe the function of the corresponding tree node, and a node name used to characterize the corresponding tree node. Figure 4 As shown, the node name can be entered at N0, and the node icon can be inserted at the circle and square.
[0086] It should be understood that the preset layout method listed above is only an example, and the present application is not limited thereto. Other arrangements can also be used to lay out each tree node to form a tree-like hierarchical topology structure.
[0087] In the embodiment of the present application, the number of the following controllable bits of the target tree node can be determined according to the total number of controllable bits of the target tree node and the number of occupied controllable bits.
[0088] Here, the controllable bits refer to the placement positions of tree nodes of other levels that can be arranged for the target tree node under the preset layout mode. The total number of controllable bits is the theoretical maximum limit of the controllable bits of the target tree node under the preset layout mode. The theoretical maximum limits corresponding to the source tree nodes and non-source tree nodes may be different.
[0089] The occupied controllable bits at least include a controllable bit occupied by the parent tree node of the target tree node. Here, the initial value of the number of occupied controllable bits corresponding to the target tree node is assigned to 1, that is, when the target tree node is a source tree node of the tree-like hierarchical topology diagram, one corner of it is the quadrant origin, and no controllable bit is placed, which is equivalent to the controllable bit of one corner of the source tree node being occupied by the parent tree node.
[0090] For non-source tree nodes, the occupied controllable bits may also include other tree nodes at the same level as the target tree node in the tree hierarchical topology diagram and non-subordinate tree nodes of the target tree node. Here, non-subordinate tree nodes are the next-level tree nodes of other tree nodes at the same level (or different levels) as the target tree node.
[0091] In one example, the structural information of the tree-like hierarchical topology diagram stores all tree nodes, node attribute information of each tree node, and edge attributes of each edge included in the tree-like hierarchical topology diagram. Exemplarily, the node attribute information may include but is not limited to at least one of the following items: node name, node icon, text information used to describe the function of the corresponding tree node, the level of the tree node, the parent tree node of the tree node, the placement position of the parent tree node, the next tree node of the tree node, and the placement position of the next tree node. In this case, by traversing the node attribute information of the tree node, the number of occupied controllable bits corresponding to the target tree node can be known.
[0092] In addition, the display diagram of the tree-like hierarchical topology diagram to which the target tree node belongs can also be obtained, and the number of occupied controllable bits corresponding to the target tree node can be determined by identifying the display diagram. The number of controllable bits below the target tree node can even be directly determined by identifying the display diagram.
[0093] For example, for each tree-like hierarchical topology diagram, a corresponding arrangement layout diagram can be pre-stored. Exemplarily, it can include multiple arrangement layout diagrams, each arrangement layout diagram corresponds to a tree node in the tree-like hierarchical topology diagram, that is, one tree node corresponds to one arrangement layout diagram, and in each arrangement layout diagram, the placement position of the controllable bit for the corresponding tree node is determined according to a preset layout method. When the preset layout method is adjusted, the placement position of the controllable bit in the arrangement layout diagram corresponding to the tree node is also adjusted accordingly.
[0094] In this case, the number of the following controllable bits of the target tree node can be determined in the following manner: call the target arrangement layout diagram corresponding to the target tree node, obtain the display diagram of the tree-like hierarchical topology diagram to which the target tree node belongs, and determine the number of the following controllable bits of the target tree node by comparing the target arrangement layout diagram and the display diagram for the target tree node. For example, align the position of the target tree node in the target arrangement layout diagram with the position of the target tree node in the display diagram, and determine the number of unoccupied controllable bits in the target arrangement layout diagram as the number of the following controllable bits.
[0095] Combine the following Figure 5 Here we introduce the method of determining the number of the following controllable bits of the target tree node.
[0096] Figure 5 A third schematic diagram showing a preset layout of a tree-like hierarchical topology diagram provided by an exemplary embodiment of the present application.
[0097] In this example, the source tree node is N0, and the source tree node N0 has three next-level tree nodes, namely N1 to N3, and the next-level tree node N3 has one next-level tree node, namely N31. For tree node N2, assuming that the total number of its controllable bits in a single quadrant is 8, the upper tree node occupies 1 controllable bit (i.e., N0), 2 controllable bits are occupied by other tree nodes at the same level as the target tree node (i.e., N1 and N3), and 1 controllable bit is occupied by a non-lower tree node (i.e., N31), then the following controllable bits x=8-1-2-1=4 are available to tree node N2.
[0098] Correspondingly, for the tree node N31, the total number of its controllable bits in a single quadrant is 8, 3 controllable bits are occupied by the upper tree node (i.e., N0, N2, N3), 0 controllable bits are occupied by other tree nodes at the same level as the target tree node, and 2 controllable bits are occupied by non-lower-level tree nodes (i.e., N23, N24). Then the following controllable bits x=8-3-0-2=3 can be used by the tree node N31.
[0099] Step S103: providing a feedback result for the node addition request according to the determined number of the following controllable bits.
[0100] Exemplarily, the feedback result can be provided by at least one of the following methods: sending the feedback result to the product demander, generating the feedback result in the form of a QR code, and publishing the feedback result to a location where the product demander can scan it, and displaying the feedback result on a graphical user interface.
[0101] In an embodiment of the present application, the feedback result for the node addition request includes a first feedback result and a second feedback result, wherein the first feedback result is used to characterize that the number of newly added bits of the target tree node is not less than the number of required bits, and the second feedback result is used to characterize that the number of newly added bits of the target tree node is less than the number of required bits.
[0102] Here, the number of newly added following bits can be determined based on the number of following controllable bits and the number of next-level tree nodes of the target tree node in the tree hierarchical topology diagram. For example, the difference between the two is determined as the number of newly added following bits, and the number of following bits required is the number of new branches indicated in the node addition request.
[0103] In an exemplary embodiment of the present application, after the feedback result is determined, different processing strategies may be executed according to different feedback results.
[0104] For example, the data processing method of the exemplary embodiment of the present application may further include: displaying a tree-like hierarchical topology diagram in a graphical user interface, and distinguishing and displaying the newly added columns of the target tree node in the tree-like hierarchical topology diagram.
[0105] In the case where the determined feedback result is the first feedback result, a new branch may be created at the newly added position.
[0106] For example, when a new branch to be created is detected at the newly added position, the new branch is connected to the target tree node through an edge to represent a hierarchical subordinate relationship between the two, thereby updating the tree-like hierarchical topology graph.
[0107] Exemplarily, the new branch may be only a newly added node, or the new branch may also include a newly added node link, where the newly added node link includes at least two newly added nodes in a hierarchical subordinate relationship.
[0108] It can be determined that a new branch to be created is detected at the newly added position by at least one of the following methods: when a selection operation of any newly added position of the target tree node is received, it is determined that a new branch to be created is detected, and the new branch is placed at the position of the selected newly added position; it is also possible to generate a floating marker for the new branch, receive a drag operation to drag the floating marker to the position of any newly added position, and when the floating marker overlaps with the position of the newly added position through the drag operation, it is determined that a new branch to be created is detected, and the new branch is placed at the position of the newly added position where there is an overlap.
[0109] In the case where the determined feedback result is the second feedback result, other placement solutions can be provided. For example, other placement solutions for new branches can be provided by adjusting the preset layout or by adjusting the display method of the tree-like hierarchical topology diagram.
[0110] In one case, a configuration interface for a tree-like hierarchical topology diagram is displayed in a graphical user interface, and according to a configuration operation on at least one configuration item, the number of the following controllable bits of a target tree node is re-determined, and corresponding feedback results are provided.
[0111] Exemplarily, the configuration interface may include but is not limited to at least one of the following configuration items: a size adjustment item, a position adjustment item, and a content adjustment item. The size adjustment item is used to adjust the size of the display area occupied by the controllable position, the position adjustment item is used to adjust the placement position of the target tree node in the tree hierarchical topology diagram, and the content adjustment item is used to adjust the content displayed in the controllable position.
[0112] Here, there may be a one-way linkage relationship between the content adjustment item and the size adjustment item. The size of the display area occupied by the controllable position is the minimum circumscribed rectangle of the content displayed in the controllable position, that is, changes in the content adjustment item will affect the size adjustment item.
[0113] In the above example, the preset layout mode may be adjusted by configuring at least one configuration item, so as to form a new feedback result based on the adjusted preset layout mode.
[0114] Below through Figure 6 This section introduces the process of adjusting the placement of the target tree node in the tree-like hierarchical topology diagram.
[0115] Figure 6 A flowchart showing the steps of adjusting the placement position of a target tree node provided by an exemplary embodiment of the present application.
[0116] In step S104, the number of the following controllable bits of the parent tree node of the target tree node is determined.
[0117] Here, the method for determining the number of the following controllable bits of the previous level tree node may be the same as the method for determining the number of the following controllable bits of the target tree node, and this application will not elaborate on this part.
[0118] In step S105, at least one optional controllable bit of the target tree node is determined according to the number of newly added controllable bits of the previous tree node and the number of the target tree node's own next-level tree nodes.
[0119] Here, the method for determining the number of newly added controllable bits of the previous tree node can be the same as the method for determining the number of newly added controllable bits of the target tree node, and this application will not repeat this part. Exemplarily, at least one optional controllable bit of the target tree node can be the difference between the number of newly added controllable bits of the previous tree node and the number of the target tree node's own next-level tree node.
[0120] In an embodiment of the present application, each optional controllable position is a newly added controllable position that satisfies a placement condition. For example, the placement condition may mean that when the target tree node is located at the newly added controllable position, the target tree node's own next-level tree nodes can all be placed within the specified canvas range.
[0121] In step S106, according to the adjustment mechanism, the target tree node is adjusted to be placed at an optional controllable position.
[0122] One of the adjustment mechanisms is random placement, for example, adjusting the target tree node to a random optional controllable position among at least one optional controllable position to regain a feedback result.
[0123] The second adjustment mechanism is cyclic placement. For example, the target tree node is adjusted to each optional controllable position in turn, and a feedback result is obtained for each adjustment.
[0124] In response to the above situation, the first feedback result and the placement plan under the first feedback result can be provided to the product demander, or the initial feedback result (second feedback result) and the subsequent adjusted results can be provided to the product demander for reference.
[0125] In another case, other placement solutions for the new branches are provided by changing the display method for the new branches.
[0126] For example, a bounding box is displayed within the specified canvas range, and the bounding box can be displayed during the above-mentioned processing of the node addition request. Exemplarily, the specified vertex of the bounding box is located at the intersection of the two straight lines forming the specified canvas range, that is, the vertex of the source tree node is processed as the quadrant origin. In addition, the bounding box is consistent with the screen size of the terminal device used to display the tree-like hierarchical topology diagram, so as to indicate whether the arrangement of the new branch exceeds the screen of the terminal device.
[0127] In this case, the data processing method of the exemplary embodiment of the present application may further include: for each specific tree node, modifying the edge attribute of the specified edge corresponding to the specific tree node. Exemplarily, the edge attribute may include but is not limited to triggering a display mechanism.
[0128] In one example, the specific tree node includes a tree node placed outside a bounding box, the designated edge includes an edge for connecting the specific tree node with its upper-level tree node, and modifying the edge attribute includes changing the trigger display mechanism for the specific tree node to an upper-level floating display.
[0129] In another example, the specific tree node includes a target tree node in which the number of newly added lower bits is less than the required number of lower bits, the specified edge includes an edge for connecting the specific tree node with the new branch, and the modified edge attribute includes changing the trigger display mechanism for the new branch to an upper floating display.
[0130] In this way, when displaying the tree-like hierarchical topology diagram, if it is detected that the trigger display mechanism in the edge attribute of the edge corresponding to a certain tree node indicates an upper-level floating display, the tree nodes connected by the edge are displayed in an upper-level floating display manner. For the first example above, each tree node located within the boundary box is displayed on the screen of the terminal device, and the tree nodes beyond the boundary box are displayed in a floating manner on the upper layer of the screen, and the tree nodes beyond the boundary box and their upper-level tree nodes are still connected by edges. For the second example above, the new branch introduced for the target tree node is displayed in a floating manner on the upper layer of the screen, and the new branch is still connected to the target tree node by an edge.
[0131] The data processing method according to the embodiment of the present application reduces the cost of trial and error for the feasibility of the solution and also helps to improve the understanding of the results among personnel throughout the entire process.
[0132] Based on the same application concept, a data processing device corresponding to the method provided in the above embodiment is also provided in the embodiment of the present application. Since the principle of solving the problem by the device in the embodiment of the present application is similar to the data processing method in the above embodiment of the present application, the implementation of the device can refer to the implementation of the method, and the repeated parts will not be repeated.
[0133] Figure 7 The following is a schematic diagram of the structure of a data processing device provided by an exemplary embodiment of the present application. Figure 7 As shown, the data processing device 200 includes:
[0134] A request receiving module 210 receives a node adding request, where the node adding request is used to instruct to create a new branch under a target tree node in the tree-like hierarchical topology graph;
[0135] The controllable position determination module 220 determines the number of the following controllable positions of the target tree node in the preset layout mode of the tree-like hierarchical topology diagram, wherein the following controllable positions represent the placement positions of the next level tree nodes extended from the target tree node;
[0136] The feedback providing module 230 provides a feedback result for the node addition request according to the determined number of the following controllable bits.
[0137] In one possible implementation of the present application, the request receiving module 210 receives the node adding request through at least one of the following items: receiving the node adding request based on a triggering operation on a target tree node of the tree hierarchical topology diagram displayed on a graphical user interface; receiving the node adding request from a product demander; receiving the node adding request based on an input operation for creating a new branch.
[0138] In a possible implementation of the present application, the number of the following controllable bits is determined based on the total number of controllable bits of the target tree node and the number of occupied controllable bits, the controllable bits refer to the placement positions of tree nodes of other levels that can be arranged for the target tree node under the preset layout method, and the occupied controllable bits include at least one controllable bit occupied by the tree node at the previous level of the target tree node.
[0139] In one possible implementation of the present application, the occupied controllable bits also include other tree nodes at the same level as the target tree node in the tree hierarchical topology diagram and non-lower-level tree nodes of the target tree node, wherein the initial value of the number of occupied controllable bits corresponding to the target tree node is assigned to 1.
[0140] In a possible implementation manner of the present application, the preset layout method includes a node arrangement method for indicating the arrangement layout of each tree node in the tree-like hierarchical topology diagram and / or a node size configuration for indicating the display size of each tree node.
[0141] In one possible implementation of the present application, the node arrangement method includes: all tree nodes are arranged within a specified canvas range, and the specified canvas range is formed by two straight lines emitted from a source tree node of the tree hierarchical topology diagram; and / or, for each tree node, multiple controllable bits of the tree node are placed around the tree node, and the adjacent edges of the tree node and the controllable bits adjacent to the placement position overlap, and the adjacent edges of two controllable bits adjacent to the placement positions also overlap.
[0142] In a possible implementation of the present application, the extension directions of the two straight lines are respectively consistent with the horizontal and vertical directions of the terminal device used to display the tree-like hierarchical topology diagram, and / or each controllable position occupies a corresponding display area within the specified canvas range, and the adjacent edge overlap includes the adjacent edges of the display areas occupied by adjacent tree nodes completely overlapping, or the adjacent edges partially overlapping.
[0143] In one possible implementation of the present application, the node size configuration includes the size of the display area corresponding to each controllable position, wherein each display area displays at least one of the following items: a node icon for representing the function of the corresponding tree node, text information for describing the function of the corresponding tree node, and a node name for representing the corresponding tree node.
[0144] In a possible implementation of the present application, the feedback result includes a first feedback result and a second feedback result, the first feedback result indicating that the number of newly added following bits of the target tree node is not less than the number of required following bits, and the second feedback result indicating that the number of newly added following bits of the target tree node is less than the number of required following bits, wherein the number of newly added following bits is determined based on the number of following controllable bits and the number of next-level tree nodes of the target tree node itself in the tree-like hierarchical topology diagram, and the number of required following bits is the number of new branches indicated in the node addition request.
[0145] In a possible implementation of the present application, it also includes: a display control module, which displays a tree-like hierarchical topology diagram in a graphical user interface, and distinguishes and displays the newly added following positions of the target tree node in the tree-like hierarchical topology diagram; when a new branch to be created is detected at the newly added following position, the new branch is connected to the target tree node through an edge to represent a hierarchical subordinate relationship between the two.
[0146] In a possible implementation of the present application, it also includes: a display control module, which displays a configuration interface for a tree-like hierarchical topology diagram in a graphical user interface, wherein the configuration interface includes at least one configuration item from the following items: a size adjustment item, a position adjustment item, and a content adjustment item, wherein the size adjustment item is used to adjust the size of a display area occupied by a controllable position, the position adjustment item is used to adjust the placement position of a target tree node in the tree-like hierarchical topology diagram, and the content adjustment item is used to adjust the content displayed in the controllable position; a controllable position determination module, which re-determines the number of the following controllable positions of a target tree node according to a configuration operation on at least one configuration item, and a feedback providing module, which provides corresponding feedback results.
[0147] In a possible implementation of the present application, there is a one-way linkage relationship between the content adjustment item and the size adjustment item, and the size of the display area occupied by the controllable position is the minimum circumscribed rectangle of the content displayed in the controllable position; and / or, the controllable position determination module adjusts the placement position of the target tree node in the tree hierarchical topology diagram in the following manner: determine the number of the following controllable positions of the upper-level tree node of the target tree node, and determine at least one optional controllable position of the target tree node according to the number of newly added controllable positions of the upper-level tree node and the number of the target tree node's own lower-level tree nodes, each optional controllable position is a newly added controllable position that meets the placement condition, and the placement condition refers to when the target tree node is located at the newly added controllable position, the target tree node's own lower-level tree nodes can all be placed within the specified canvas range, and the target tree node is adjusted to a random one of the at least one optional controllable position to obtain a feedback result again, or the target tree node is adjusted to each optional controllable position in turn, and a feedback result is obtained for each adjustment.
[0148] In a possible implementation of the present application, it also includes: a display control module, which displays a bounding box within a specified canvas range, wherein the specified vertex of the bounding box is located at the intersection of the two straight lines, and the bounding box is consistent with the screen size of the terminal device used to display the tree-like hierarchical topology diagram.
[0149] In a possible implementation of the present application, it also includes: an adjustment module, for each specific tree node, modifying the edge attributes of the specified edge corresponding to the specific tree node, the edge attributes including a trigger display mechanism, wherein the specific tree node includes a tree node placed outside the boundary box, the specified edge includes an edge for connecting the specific tree node with its upper-level tree node, and modifying the edge attributes includes changing the trigger display mechanism for the specific tree node to an upper-level floating display, and / or the specific tree node includes a target tree node with a number of newly added lower digits less than the required number of lower digits, the specified edge includes an edge for connecting the specific tree node with a new branch, and modifying the edge attributes includes changing the trigger display mechanism for the new branch to an upper-level floating display.
[0150] In a possible implementation manner of the present application, the tree-like hierarchical topology diagram includes any one of the following items: a building tree, a technology tree, a talent tree, a behavior tree, a weapon tree, and a prop tree in the game.
[0151] The data processing device proposed in the present application can estimate the scalability of the tree-like hierarchical topology diagram, reduce the cost of trial and error of the feasibility of the solution, and improve the processing efficiency.
[0152] See also Figure 8 , Figure 8 The schematic diagram of the structure of the electronic device provided by the exemplary embodiment of the present application. Figure 8 As shown, the electronic device 300 includes a processor 310 , a memory 320 and a bus 330 .
[0153] The memory 320 stores machine-readable instructions executable by the processor 310. When the electronic device 300 is running, the processor 310 communicates with the memory 320 via the bus 330. When the machine-readable instructions are executed by the processor 310, the steps of the information processing method in the game in any of the above embodiments can be executed, which are specifically as follows:
[0154] Receive a node addition request, the node addition request is used to indicate the creation of a new branch under a target tree node in a tree-like hierarchical topology diagram; determine the number of following controllable bits of the target tree node under a preset layout of the tree-like hierarchical topology diagram, the following controllable bits representing the placement position of the next level tree node extended from the target tree node; and provide feedback results for the node addition request based on the determined number of following controllable bits.
[0155] The electronic device proposed in the present application can estimate the scalability of the tree-like hierarchical topology diagram, reduce the cost of trial and error of the feasibility of the solution, and improve processing efficiency.
[0156] The present application also provides a computer-readable storage medium, on which a computer program is stored. When the computer program is executed by a processor, the steps of the information processing method in the game in any of the above embodiments can be executed, which are as follows:
[0157] Receive a node addition request, the node addition request is used to indicate the creation of a new branch under a target tree node in a tree-like hierarchical topology diagram; determine the number of following controllable bits of the target tree node under a preset layout of the tree-like hierarchical topology diagram, the following controllable bits representing the placement position of the next level tree node extended from the target tree node; and provide feedback results for the node addition request based on the determined number of following controllable bits.
[0158] The computer-readable storage medium proposed in the present application can estimate the scalability of the tree-like hierarchical topology diagram, reduce the cost of trial and error of the feasibility of the solution, and improve processing efficiency.
[0159] Those skilled in the art can clearly understand that, for the convenience and simplicity of description, the specific working process of the system and device described above can refer to the corresponding process in the aforementioned method embodiment, and will not be repeated here. In the several embodiments provided in the present application, it should be understood that the disclosed system, device and method can be implemented in other ways. The device embodiments described above are merely schematic. For example, the division of the units is only a logical function division. There may be other division methods in actual implementation. For example, multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some communication interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.
[0160] The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
[0161] In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.
[0162] If the function is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a non-volatile computer-readable storage medium that is executable by a processor. Based on this understanding, the technical solution of the present application, or the part that contributes to the prior art or the part of the technical solution, can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including a number of instructions to enable a computer device (which can be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present application. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM), random access memory (RAM), disk or optical disk, etc., various media that can store program codes.
[0163] The above are only specific implementations of the present application, but the protection scope of the present application is not limited thereto. Any technician familiar with the technical field can easily think of changes or substitutions within the technical scope disclosed in the present application, which should be included in the protection scope of the present application. Therefore, the protection scope of the present application should be based on the protection scope of the claims.
Claims
1. A data processing method, characterized in that: The method comprises: Receive a node adding request, wherein the node adding request is used to instruct to create a new branch under a target tree node of the tree-like hierarchical topology graph; Determine the number of the following controllable bits of the target tree node in the preset layout mode of the tree-like hierarchical topology diagram, wherein the following controllable bits represent the placement positions of the next level tree nodes extended from the target tree node; According to the determined number of the following controllable bits, a feedback result for the node addition request is provided.
2. The method according to claim 1, characterized in that The step of receiving a node addition request includes at least one of the following items: Receiving the node adding request according to a triggering operation on a target tree node of the tree-like hierarchical topology diagram displayed on a graphical user interface; Receiving the node addition request from the product demander; According to an input operation for creating a new branch, the node adding request is received.
3. The method according to claim 1, characterized in that: The number of the following controllable bits is determined based on the total number of controllable bits of the target tree node and the number of occupied controllable bits. The controllable bits refer to the placement positions of tree nodes of other levels that can be arranged for the target tree node under the preset layout method. The occupied controllable bits include at least one controllable bit occupied by the parent tree node of the target tree node.
4. The method according to claim 3, characterized in that The occupied controllable bits also include other tree nodes at the same level as the target tree node in the tree-like hierarchical topology diagram and tree nodes that are not subordinate to the target tree node. Among them, the initial value of the number of occupied controllable bits corresponding to the target tree node is assigned to 1.
5. The method according to any one of claims 1 to 4, characterized in that The preset layout method includes a node arrangement method for indicating the arrangement layout of each tree node in the tree-like hierarchical topology diagram and / or a node size configuration for indicating the display size of each tree node.
6. The method according to claim 5, characterized in that The node arrangement method includes: All tree nodes are arranged within a specified canvas range, wherein the specified canvas range is formed by two straight lines emitted from a source tree node of the tree-like hierarchical topology graph; And / or, for each tree node, multiple controllable bits of the tree node are placed around the tree node, and the adjacent sides of the controllable bits adjacent to the placement position of the tree node overlap, and the adjacent sides of two controllable bits adjacent to the placement position also overlap.
7. The method according to claim 6, characterized in that The extending directions of the two straight lines are respectively consistent with the horizontal and vertical directions of the terminal device used to display the tree-like hierarchical topology diagram. And / or, each controllable bit occupies a corresponding display area within a specified canvas range, and the adjacent edge overlap includes that the adjacent edges of the display areas occupied by adjacent tree nodes completely overlap, or the adjacent edges partially overlap.
8. The method according to claim 7, characterized in that The node size configuration includes the size of the display area corresponding to each controllable position, wherein each display area displays at least one of the following items: a node icon for representing the function of the corresponding tree node, text information for describing the function of the corresponding tree node, and a node name for representing the corresponding tree node.
9. The method according to claim 1, characterized in that: The feedback result includes a first feedback result and a second feedback result, the first feedback result indicates that the number of newly added bits of the target tree node is not less than the number of required bits, and the second feedback result indicates that the number of newly added bits of the target tree node is less than the number of required bits, Among them, the number of newly added following bits is determined according to the number of following controllable bits and the number of next-level tree nodes of the target tree node in the tree-like hierarchical topology diagram, and the number of following bits required is the number of new branches indicated in the node addition request.
10. The method according to claim 1 or 9, characterized in that: Also includes: Displaying a tree-like hierarchical topology diagram in a graphical user interface, and distinguishing and displaying the newly added columns of the target tree node in the tree-like hierarchical topology diagram; When a new branch to be created is detected at the newly added following position, the new branch is connected to the target tree node through an edge to represent a hierarchical subordinate relationship between the two.
11. The method according to claim 1 or 9, characterized in that: Also includes: Displaying a configuration interface for the tree-like hierarchical topology diagram in a graphical user interface, the configuration interface including at least one configuration item of the following items: a size adjustment item, a position adjustment item, and a content adjustment item, the size adjustment item being used to adjust the size of a display area occupied by a controllable position, the position adjustment item being used to adjust a placement position of a target tree node in the tree-like hierarchical topology diagram, and the content adjustment item being used to adjust content displayed in the controllable position; According to the configuration operation on at least one configuration item, the number of the following controllable bits of the target tree node is re-determined, and a corresponding feedback result is provided.
12. The method according to claim 11, characterized in that There is a one-way linkage relationship between the content adjustment item and the size adjustment item, and the size of the display area occupied by the controllable position is the minimum circumscribed rectangle of the content displayed in the controllable position; And / or, adjust the placement of the target tree node in the tree hierarchy topology diagram by: Determine the number of the following controllable bits of the parent tree node of the target tree node, According to the number of newly added controllable bits of the previous tree node and the number of the target tree node's own next-level tree nodes, at least one optional controllable bit of the target tree node is determined, each optional controllable bit is a newly added controllable bit that satisfies a placement condition, wherein the placement condition means that when the target tree node is located at the newly added controllable bit, the target tree node's own next-level tree nodes can all be placed within the specified canvas range. The target tree node is adjusted to be placed at a random optional controllable position among the at least one optional controllable position to obtain a feedback result again, or the target tree node is adjusted to each optional controllable position in turn, and a feedback result is obtained each time the adjustment is made.
13. The method according to claim 6, characterized in that Also includes: A bounding box is displayed within the specified canvas range, the specified vertex of the bounding box is located at the intersection of the two straight lines, and the bounding box is consistent with the screen size of the terminal device used to display the tree-like hierarchical topology diagram.
14. The method according to claim 11, characterized in that Also includes: For each specific tree node, modify the edge attribute of the specified edge corresponding to the specific tree node, wherein the edge attribute includes a trigger display mechanism, The specific tree node includes a tree node placed outside the bounding box, the designated edge includes an edge for connecting the specific tree node with a tree node at an upper level, and modifying the edge attribute includes changing the trigger display mechanism for the specific tree node to an upper floating display. And / or, the specific tree node includes a target tree node in which the number of newly added following bits is less than the number of required following bits, the designated edge includes an edge for connecting the specific tree node with the new branch, and modifying the edge attributes includes changing the trigger display mechanism for the new branch to an upper floating display.
15. The method according to claim 1, characterized in that The tree-like hierarchical topology diagram includes any one of the following items: a building tree, a technology tree, a talent tree, a behavior tree, a weapon tree, and a prop tree in the game.
16. A data processing device, characterized in that: The device comprises: A request receiving module receives a node adding request, wherein the node adding request is used to instruct to create a new branch under a target tree node of the tree-like hierarchical topology graph; A controllable position determination module determines the number of the following controllable positions of the target tree node under the preset layout mode of the tree-like hierarchical topology diagram, wherein the following controllable positions represent the placement positions of the next level tree nodes extended from the target tree node; The feedback providing module provides feedback results for the node addition request according to the determined number of the following controllable bits.
17. An electronic device, characterized in that: include: A processor, a storage medium and a bus, wherein the storage medium stores machine-readable instructions executable by the processor, and when the electronic device is running, the processor and the storage medium communicate via the bus, and the processor executes the machine-readable instructions to perform the steps of any method as claimed in claims 1 to 15.
18. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 15 are executed.
Citation Information
Patent Citations
Method for realizing dynamic topology
CN102571417A
Video display method and device of Android intelligent terminal browser
CN105446585A
Data processing apparatus and method for rendering a tree structure
CN107209630A
Node addition method, device, device and storage medium for mind map
CN109324722A
Vue-based thinking brain map drawing method and related device
CN113628301A
