CN114968787B - Method and device for testing based on node relation and electronic equipment - Google Patents

Abstract

The application discloses a test method based on node relation, which belongs to the technical field of computers and is used for automatically determining test case nodes needing to be tested and improving the automatic test efficiency. The method comprises the following steps: determining node relations among test case nodes, wherein the node relations comprise a preposition relation and a postposition relation; carrying out structural processing on each test case node according to the node relation to obtain target node information of each test case node, wherein the target node information comprises a front-end case node, a current case node and a rear-end case node; determining a target test case node queue based on the target node information and a target step traversal algorithm; and testing according to the target test case node queue.

Description

Testing methods, devices and electronic equipment based on node relationships

Technical field

This application belongs to the field of computer technology, and specifically relates to a testing method, device and electronic equipment based on node relationships.

Background technique

At present, automated testing of applications with the help of software testing tools has become more and more widely used. In automated testing of applications, testers usually identify test cases, find the corresponding test cases or test case sets by running the specified identification or file, and execute the corresponding test cases or test case sets to implement the test script. Specified execution of test cases.

In related technologies, when the number of test cases reaches a certain level and there are pre-, post- and other relationships between test cases, it is impossible to efficiently plan and manage tests using conventional usage files, test case collections or test case identifiers. Problems such as low efficiency of use cases and testing.

Contents of the invention

Embodiments of the present application provide a test method, device, electronic device and readable storage medium based on node relationships, which can manage test cases based on node relationships, automatically determine the test case nodes that need to be tested, and improve the efficiency of automated testing.

In the first aspect, embodiments of the present application provide a testing method based on node relationships. The method includes: determining node relationships between test case nodes, where the node relationships include pre-relationships and post-relationships; according to the node relationship, perform structured processing on each test case node, and obtain the target node information of each test case node. The target node information includes the pre-use case node, the current use case node and the post-use case node; based on the target The node information and the target step traverse algorithm determine the target test case node queue; conduct testing according to the target test case node queue.

In the second aspect, embodiments of the present application provide a testing device based on node relationships, including: a first determination module for determining node relationships between test case nodes, where the node relationships include pre-relationships and post-relationships. ; A structured module, used to perform structured processing on each test case node according to the node relationship, and obtain the target node information of each test case node, where the target node information includes a pre-use case node, a current use case nodes and post-use case nodes; the second determination module is used to determine the target test case node queue based on the target node information and the target step traversal algorithm; the test module is used to perform testing according to the target test case node queue.

In a third aspect, embodiments of the present application provide an electronic device. The electronic device includes a processor, a memory, and a program or instructions stored on the memory and executable on the processor. The program or instructions are When executed by the processor, the steps of the method described in the first aspect are implemented.

In a fourth aspect, embodiments of the present application provide a readable storage medium. Programs or instructions are stored on the readable storage medium. When the programs or instructions are executed by a processor, the steps of the method described in the first aspect are implemented. .

In a fifth aspect, embodiments of the present application provide a chip. The chip includes a processor and a communication interface. The communication interface is coupled to the processor. The processor is used to run programs or instructions to implement the first aspect. the method described.

In the embodiment of this application, by determining the node relationships between test case nodes, the node relationships include pre-relationships and post-relationships; according to the node relationships, each test case node is structured and processed to obtain the Describe the target node information of each test case node, the target node information includes the pre-use case node, the current use case node and the post-use case node; based on the target node information and the target step traversal algorithm, determine the target test case node queue; Test according to the target test case node queue. As a result, test cases can be managed based on node relationships, test case nodes that need to be tested can be automatically determined, and automated testing efficiency can be improved.

Description of drawings

Figure 1 is a schematic flow chart of a testing method based on node relationships provided by an embodiment of the present application;

Figure 2 is a schematic diagram of a test process of a test case node provided by an embodiment of the present application;

Figure 3 is a schematic flow chart of a testing method based on node relationships provided by another embodiment of the present application;

Figure 4 is a schematic structural diagram of a testing device based on node relationships according to an embodiment of the present application;

Figure 5 is a schematic structural diagram of an electronic device according to an embodiment of the present application.

Detailed ways

The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present application. Obviously, the described embodiments are part of the embodiments of the present application, rather than all of the embodiments. Based on the embodiments in this application, all other embodiments obtained by those of ordinary skill in the art without creative efforts fall within the scope of protection of this application.

The terms "first", "second", etc. in the description and claims of this application are used to distinguish similar objects and are not used to describe a specific order or sequence. It is to be understood that the figures so used are interchangeable under appropriate circumstances so that the embodiments of the present application can be practiced in orders other than those illustrated or described herein, and that "first," "second," etc. are distinguished Objects are usually of one type, and the number of objects is not limited. For example, the first object can be one or multiple. In addition, "and/or" in the description and claims indicates at least one of the connected objects, and the character "/" generally indicates that the related objects are in an "or" relationship.

The testing method based on node relationships provided by the embodiments of the present application will be described in detail below with reference to the accompanying drawings through specific embodiments and application scenarios.

Figure 1 shows a schematic flow chart of a node relationship-based testing method 100 provided by an embodiment of the present application. The method can be executed by an electronic device, and the electronic device can include: a server and/or a terminal device. In other words, the method can be executed by software or hardware installed on the electronic device, and the method includes the following steps:

110: Determine the node relationships between test case nodes. Wherein, the node relationships include pre-relationships and post-relationships.

It can be understood that before step 110, the method also includes: decomposing the test cases into the flow chart according to the steps of the test process.

Among them, each test case corresponds to a test case node in the flow chart.

When there are changes to the test process, the test cases will be re-decomposed into the flow chart according to the steps of the changed test process.

120: Perform structured processing on each test case node according to the node relationship, and obtain the target node information of each test case node. Wherein, the target node information includes front use case nodes, current use case nodes and post use case nodes.

It can be understood that the test case nodes that need to be executed before the current use case node is executed are the previous use case nodes of the current use case node, and the test case nodes that need to be executed after the current use case node is executed are the post-use case nodes of the current use case node. If there is no previous use case node in the current use case node, then the current use case node is the starting use case node. If there is no post use case node in the current use case node, then the current use case node is the result use case node. In the target node information, the preceding use case nodes of the starting use case node and the subsequent use case nodes of the result use case node can be identified using specific identification use case nodes.

According to the pre-relationship and post-relationship between test case nodes, perform structural processing on each test case node, determine the pre-case node and post-case node of each test case node, and obtain each test case node. target node information.

The target node information of a test case node can be used to indicate the test case node, the preceding case node of the test case node, and the succeeding case node of the test case node.

Figure 2 is a schematic diagram of the testing process of a test case node. As you can see, the current use case node has one pre-use case node and three post-use case nodes. To execute the current use case node, you need to execute the pre-use case node first. After the execution of the current use case node is completed, there are three post-use case nodes that you can choose to execute. Only one post-use case node can be executed at a time.

In one implementation, the target node information is nested list format data. Taking the test case node in Figure 2 as an example, the target node information of the current use case node is as follows:

[Pre-use case node, current use case node, [post-use case node 1, post-use case node 2, post-use case node 3]].

In an implementation manner, after obtaining the target node information of each test case node, a target node information library testcaseNodeDict is generated according to the target node information of the test case node. The target node information library testcaseNodeDict includes target node information of all test case nodes.

In the target node information library testcaseNodeDict, the key name is the name of the test case node testcaseNode, where the name of each test case node is unique. The name of the test case node can be used to search for the unique name in the target node information library. The corresponding test case node. In the target node information library testcaseNodeDict, the key value corresponding to the key name is the target node information of the test case node. The target node information base testcaseNodeDict can be, for example: {"testcaseNode1": [pre-use case node 1, current use case node 1, [post-use case node 11, post-use case node 12, post-use case node 13]]; " testcaseNode2": [pre-use case node 2, current use case node 2, [post-use case node 21, post-use case node 22, post-use case node 23]]; ....; "testcaseNodeN": [pre-use case Node N, current use case node N, [post use case node N1, post use case node N2, post use case node N3]]}.

In one implementation manner, the target node information of each test case node includes one pre-test case node.

In other words, the decomposition of test cases and the structured processing of test case nodes need to meet the rule that each test case node has only one pre-case node.

130: Based on the target node information and the target step traversal algorithm, determine the target test case node queue.

The target test case node queue is used to indicate the test case nodes that need to be tested and the test order of the test case nodes.

Among them, the determined target test case node queue may have only one, or may include multiple.

Among them, a test case node queue can be as follows: {"testcaseNodeA"-"testcaseNodeB"-"testcaseNodeC"-...-"testcaseNodeN"}. Among them, the test order of test case nodes is from "testcaseNodeA" to "testcaseNodeN".

140: Test according to the target test case node queue.

Test according to the test case nodes in the target test case node queue that need to be tested and the test order of the test case nodes.

As a result, test cases can be managed based on node relationships, the test case nodes that need to be tested can be automatically determined, and the test case nodes that need to be tested can be tested according to the test order, thereby improving the efficiency of automated testing.

In one implementation, in step 120, each test case node is structured according to the node relationship, and after obtaining the target node information of each test case node, the method further includes: according to each test case The target node information of the node generates the test case script code for each test case node.

Convert the target node information of each test case node into test case script code. It should be understood that after obtaining the test case script code of the test case node, you only need to fill in the process operation code of the test case node to complete the code editing of the test case node. As a result, you only need to add steps to implement the code and it can be executed directly, thereby reducing code maintenance costs.

If the target node information of the test case node is changed, a new test case script code is regenerated based on the changed target node information.

In step 140, the test case script code of the test case node in the target test case node queue can be called for testing.

The embodiment of the present application provides a testing method based on node relationships, by determining the node relationships between test case nodes, the node relationships include pre-relationships and post-relationships; according to the node relationships, each test case is The nodes undergo structured processing to obtain the target node information of each test case node. The target node information includes the pre-use case node, the current use case node and the post-use case node; based on the target node information and target step traversal algorithm , determine the target test case node queue; perform testing according to the target test case node queue. As a result, test cases can be managed based on node relationships, the test case nodes that need to be tested can be automatically determined, and the test case nodes that need to be tested can be tested according to the test order, thereby improving the efficiency of automated testing.

Figure 3 shows a schematic flowchart of a node relationship-based testing method 200 provided by an embodiment of the present application. The method can be executed by an electronic device, and the electronic device can include: a server and/or a terminal device. In other words, the method can be executed by software or hardware installed on the electronic device, and the method includes the following steps:

210: Determine node relationships between test case nodes. Wherein, the node relationships include pre-relationships and post-relationships.

220: Perform structured processing on each test case node according to the node relationship, and obtain the target node information of each test case node. Wherein, the target node information includes front use case nodes, current use case nodes and post use case nodes.

Steps 210-220 may adopt the description of steps 110-120 in the embodiment of Figure 1, and will not be described again here.

231: Determine the target execution mode.

In the embodiment of the present application, multiple different execution modes are distinguished, and different execution modes correspond to different step traversal algorithms. Therefore, before determining the target test case node queue based on the target node information and the target step traversal algorithm, the target execution mode is first determined. The target execution mode is one of the specified use case execution mode, the full use case execution mode, and the specified node associated use case execution mode.

Among them, the specified test case execution mode is used to test the specified test case node, the full use case execution mode is used to test all test case nodes, and the specified node associated use case execution mode is used to test the associated test case nodes of the specified test case node. .

232: Determine the target step traversal algorithm according to the target execution mode.

233: Determine the target test case node queue based on the target node information and the target step traversal algorithm.

When the target execution mode is the specified use case execution mode, based on the target node information, a forward query step traversal algorithm is used for the specified first test case node to obtain the target test case node queue.

Among them, the specified use case execution mode is tested against the specified first test case node, and the forward query step traversal algorithm is used for the specified first test case node, that is, starting from the first test case node, querying the preceding use case nodes forward , until the starting point use case node, thus obtaining a target test case node queue, and the test sequence is from the starting point use case node to the first test case node.

For example: specify the test case execution mode to test the first test case node testcaseNodeOne. First define a two-way queue testcaseNodeOneStep and put testcaseNodeOne into the queue; then take out testcaseNodeOne's pre-test case testcaseNodeOneBack1＝ from the target node information library testcaseNodeDict. testcaseNodeDict["testcaseNodeOne"][0], and add the value of testcaseNodeOneBack1 to the bidirectional queue testcaseNodeOneStep from the left. At this time, the value of the bidirectional queue is [testcaseNodeOneBack1, testcaseNodeOne]; continue to take out the pre-used case of testcaseNodeOneBack1 testcaseNodeOneBack2 = testcaseNodeDict["testcaseNodeOneBack1" ][0], and add the value of testcaseNodeOneBack2 to the bidirectional queue testcaseNodeOneStep from the left. At this time, the value of the bidirectional queue is [testcaseNodeOneBack2, testcaseNodeOneBack1, testcaseNodeOne]; loop the value in this way until testcaseNodeDict["testcaseNodeOneBack1N"][0] =0 stops the loop, where testcaseNodeDict["testcaseNodeOneBack1N"][0]=0 means "testcaseNodeOneBack1N" is the starting use case node. At this time, the value of testcaseNodeOneStep is [testcaseNodeOneBack1N,..., testcaseNodeOneBack2, testcaseNodeOneBack1, testcaseNodeOne]. According to the value of the queue testcaseNodeOneStep, it can be determined that the execution steps of testcaseNodeOne start from testcaseNodeOneBack1N and are executed in sequence to testcaseNodeOne. To test the first test case node testcaseNodeOne is to execute each test case node sequentially in the order of the testcaseNodeOneStep queue.

When the target execution mode is the full use case execution mode, based on the target node information, the forward query step traversal algorithm is used for all result use case nodes to obtain the target test case node queue.

Among them, the full use case execution mode tests all test case nodes, uses the forward query step traversal algorithm for all result use case nodes one by one, determines the test case node queue of each result use case node, and then executes each result use case node in sequence , thus completing the full test.

When the target execution mode is the use case execution mode associated with the specified node, based on the target node information, the forward query step traversal algorithm and the backward backtracking step traversal algorithm are used for the specified second test case node to obtain the target test case node queue.

Among them, the specified node associated test case execution mode tests the associated test case node of the specified second test case node, and uses the forward query step traversal algorithm and the backward backtracking step traversal algorithm to obtain the target test Use case node queue.

For example: Specify the node associated test case execution mode to specify the test case node associated with the second test case node testcaseNodeOne. First, perform the forward query step traversal algorithm on the second test case node testcaseNodeOne to obtain the test step path testcaseNodeOneStep of testcaseNodeOne; Then use the backtracking step traversal algorithm to complete the step calculation from the second test case node testcaseNodeOne to the result use case node. The details are as follows: first, retrieve the post-case list of testcaseNodeOne from the target node information library testcaseNodeDict testcaseNodeOneAfter=testcaseNodeDict["testcaseNodeOne" ][2], calculate the number of nodes in the testcaseNodeOneAfter list Num = len (testcaseNodeOneAfter), which means that the testcaseNodeOne post-step has Num paths; then, testcaseNodeOneAfter[0], testcaseNodeOneAfter[1], ..., testcaseNodeOneAfter[Num] Each has its own post-path. The post-path backtracking algorithm is used to search for the post-use case node from the second test case node testcaseNodeOne. Starting from testcaseNodeOne, all post-use case nodes select the first post-use case node until the result use case is reached. Node testcaseNodeDict["testcaseNodeOneAfter1"][2]=0, record the execution path testcaseNodeOneAfterStep1 and the associated result use case node testcaseNodeOneEnd1, then traverse back and store all paths into a list of N steps: testcaseNodeOneAfterStep1, testcaseNodeOneAfterStep2,..., testcaseNodeOneAfterStepN. Finally, the execution steps of these N associated result use case nodes are: testcaseNodeOneStep+testcaseNodeOneAfterStep1, testcaseNodeOneStep+testcaseNodeOneAfterStep2,..., testcaseNodeOneStep+testcaseNodeOneAfterStepN.

In an implementation manner, when the function of the third test case node is changed, the target execution mode is determined to be the specified node associated use case execution mode. The specified node associated test case execution mode is used to test the associated test case node of the specified second test case node.

As a result, regression testing can be performed in a targeted manner, and only test case nodes associated with the specified test case node that have changed will be tested, and unrelated test case nodes will not be executed, thereby reducing test execution time and further improving test efficiency.

240: Test according to the target test case node queue.

Step 240 may adopt the description of step 140 in the embodiment of Figure 1 and will not be described again.

The embodiment of the present application provides a testing method based on node relationships, by determining the node relationships between test case nodes, the node relationships include pre-relationships and post-relationships; according to the node relationships, each test case is The nodes undergo structured processing to obtain the target node information of each test case node. The target node information includes the pre-use case node, the current use case node and the post-use case node; based on the target node information and target step traversal algorithm , determine the target test case node queue; perform testing according to the target test case node queue. As a result, test cases can be managed based on node relationships, the test case nodes that need to be tested can be automatically determined, and the test case nodes that need to be tested can be tested according to the test order, thereby improving the efficiency of automated testing.

A testing method based on node relationships provided by embodiments of the present application determines the target execution mode; determines the target step traversal algorithm according to the target execution mode; wherein the target execution mode is a designated use case execution mode, a full The use case execution mode is associated with one of the use case execution modes of the specified node. Therefore, different step traversal algorithms can be used to determine the target test case node queue according to different execution modes, thereby improving testing efficiency.

Figure 4 is a schematic structural diagram of a testing device based on node relationships according to an embodiment of the present application. As shown in FIG. 4 , the node relationship-based testing device 300 includes: a first determination module 310 , a structuring module 320 , a second determination module 330 , and a test module 340 . The first determination module 310 is used to determine the node relationship between the test case nodes, the node relationship includes the pre-relationship and the post-relationship; the structuring module 320 is used to determine each test case node according to the node relationship. Perform structured processing to obtain the target node information of each test case node. The target node information includes a pre-use case node, a current use case node and a post-use case node; the second determination module 330 is used to determine based on the target The node information and target step traversal algorithm determine the target test case node queue; the test module 340 is used to perform testing according to the target test case node queue.

In an implementation manner, the device further includes a script generation module, configured to generate the test case script code of each test case node according to the target node information of each test case node. The test module is used to call the test case script code of the test case node in the target test case node queue for testing.

In one implementation, the device further includes a third determination module for determining a target execution mode; determining the target step traversal algorithm according to the target execution mode; wherein the target execution mode is specified use case execution mode, full use case execution mode, and specified node associated use case execution mode.

In one implementation, the second determination module is configured to use the previous method for the designated first test case node based on the target node information when the target execution mode is the specified use case execution mode. The forward query step traversal algorithm is used to obtain the target test case node queue; when the target execution mode is the full use case execution mode, based on the target node information, the forward query step traversal algorithm is used for all result use case nodes, Obtain the target test case node queue; when the target execution mode is the use case execution mode associated with the specified node, based on the target node information, use the forward query step traversal algorithm and the forward query step for the specified second test case node. After the backtracking step, the algorithm is traversed to obtain the target test case node queue.

In an implementation manner, the third determination module is configured to determine that the target execution mode is the specified node associated use case execution mode when the function of the third test case node is changed.

In an implementation manner, the device further includes a decomposition module for decomposing the test cases into the flow chart according to the steps of the test process; wherein each test case corresponds to a test case node in the flow chart.

The test device based on node relationships in the embodiment of the present application may be a device, or may be a component, integrated circuit, or chip in a terminal. The device may be a mobile electronic device or a non-mobile electronic device. For example, the mobile electronic device may be a mobile phone, a tablet computer, a notebook computer, a handheld computer, a vehicle-mounted electronic device, a wearable device, an ultra-mobile personal computer (UMPC), a netbook or a personal digital assistant (personal digital assistant). assistant, PDA), etc., and the non-mobile electronic device can be a server, Network Attached Storage (NAS), personal computer (PC), television (television, TV), teller machine or self-service machine, etc., this application The examples are not specifically limited.

The node relationship-based testing device in the embodiment of the present application may be a device with an operating system. The operating system can be an Android operating system, an ios operating system, or other possible operating systems, which are not specifically limited in the embodiments of this application.

The node relationship-based testing device provided by the embodiments of the present application can implement each process in the node relationship-based testing method provided by any of the above embodiments. To avoid duplication, the details will not be described here.

Figure 5 is a schematic diagram of the hardware structure of an electronic device that implements an embodiment of the present application. The electronic device can be a terminal device or a server device. The electronic device includes: an antenna 401, a radio frequency device 402, a baseband device 403, a network interface 404, and a memory. 405 and processor 406, a program or instructions stored on memory 405 and executable on said processor 406, which when executed by processor 406 implement:

Among them, the processor 406 is used to determine the node relationship between test case nodes, the node relationship includes a pre-relationship and a post-relationship; according to the node relationship, perform structured processing on each test case node to obtain the The target node information of each test case node, the target node information includes the pre-use case node, the current use case node and the post-use case node; based on the target node information and the target step traversal algorithm, determine the target test case node queue; according to The target test case node queue is tested.

In one implementation, the processor 406 is configured to generate the test case script code of each test case node according to the target node information of each test case node. Call the test case script code of the test case node in the target test case node queue to perform testing.

In one implementation, the processor 406 is used to determine a target execution mode; determine the target step traversal algorithm according to the target execution mode; wherein the target execution mode is a specified use case execution mode, a full use case execution mode, and Specifies one of the node-associated use case execution modes.

In one implementation, the processor 406 is configured to use a forward query step to traverse the specified first test case node based on the target node information when the target execution mode is the specified use case execution mode. algorithm to obtain the target test case node queue; when the target execution mode is the full use case execution mode, based on the target node information, use the forward query step traversal algorithm for all result use case nodes to obtain the target test case Node queue; when the target execution mode is the specified node-associated use case execution mode, based on the target node information, the forward query step traversal algorithm and the backward traceback step traversal are used for the specified second test case node. Algorithm to obtain the target test case node queue.

In one implementation, the processor 406 is configured to determine that the target execution mode is the specified node-associated use case execution mode when the function of the third test case node is changed.

In one implementation, the processor 406 is configured to decompose the test cases into a flow chart according to the steps of the test process; where each test case corresponds to a test case node in the flow chart.

The electronic device 400 according to the embodiment of the present application can refer to the process corresponding to the methods 100-200 of the embodiment of the present application, and each unit/module in the electronic device 400 and the above-mentioned other operations and/or functions are respectively intended to implement the methods 100-200. 200, and can achieve the same or equivalent technical effects. For the sake of simplicity, they will not be repeated here.

Embodiments of the present application also provide a readable storage medium, the readable storage medium stores a program or instructions, and when the program or instructions are executed by a processor, each process of the above-mentioned node relationship-based testing method embodiment is implemented, and can achieve the same technical effect, so to avoid repetition, we will not repeat them here.

Wherein, the processor is the processor in the electronic device described in the above embodiment. The readable storage medium includes computer readable storage media, such as computer read-only memory (Read-Only Memory, ROM), random access memory (Random Access Memory, RAM), magnetic disk or optical disk, etc.

An embodiment of the present application further provides a chip. The chip includes a processor and a communication interface. The communication interface is coupled to the processor. The processor is used to run programs or instructions to implement the above 100-200 method embodiments. Each process can achieve the same technical effect. To avoid repetition, we will not go into details here.

It should be understood that the chips mentioned in the embodiments of this application may also be called system-on-chip, system-on-a-chip, system-on-a-chip or system-on-chip, etc.

It should be noted that, in this document, the terms "comprising", "comprises" or any other variations thereof are intended to cover a non-exclusive inclusion, such that a process, method, article or device that includes a series of elements not only includes those elements, It also includes other elements not expressly listed or inherent in the process, method, article or apparatus. Without further limitation, an element defined by the statement "comprises a..." does not exclude the presence of additional identical elements in a process, method, article or apparatus that includes that element. In addition, it should be pointed out that the scope of the methods and devices in the embodiments of the present application is not limited to performing functions in the order shown or discussed, but may also include performing functions in a substantially simultaneous manner or in reverse order according to the functions involved. Functions may be performed, for example, the methods described may be performed in an order different from that described, and various steps may be added, omitted, or combined. Additionally, features described with reference to certain examples may be combined in other examples.

Through the above description of the embodiments, those skilled in the art can clearly understand that the methods of the above embodiments can be implemented by means of software plus the necessary general hardware platform. Of course, it can also be implemented by hardware, but in many cases the former is better. implementation. Based on this understanding, the technical solution of the present application can be embodied in the form of a software product in essence or that contributes to the existing technology. The computer software product is stored in a storage medium (such as ROM/RAM, disk, CD), including several instructions to cause a terminal (which can be a mobile phone, computer, server, air conditioner, or network device, etc.) to execute the methods described in various embodiments of this application.

The embodiments of the present application have been described above in conjunction with the accompanying drawings. However, the present application is not limited to the above-mentioned specific implementations. The above-mentioned specific implementations are only illustrative and not restrictive. Those of ordinary skill in the art will Inspired by this application, many forms can be made without departing from the purpose of this application and the scope protected by the claims, all of which fall within the protection of this application.

Claims (8)

1. A testing method based on node relationships, characterized in that the method includes: Determine node relationships between test case nodes, where the node relationships include pre-relationships and post-relationships; According to the node relationship, perform structured processing on each test case node to obtain the target node information of each test case node, where the target node information includes a pre-use case node, a current use case node and a post-use case node; Based on the target node information and the target step traversal algorithm, determine the target test case node queue; Test according to the target test case node queue; Before determining the target test case node queue based on the target node information and the target step traversal algorithm, the method further includes: Determine target execution mode; Determine the target step traversal algorithm according to the target execution mode; Wherein, the target execution mode is one of the specified use case execution mode, the full use case execution mode and the specified node associated use case execution mode; Determining the target test case node queue based on the target node information and target step traversal algorithm includes: When the target execution mode is the specified use case execution mode, based on the target node information, a forward query step traversal algorithm is used for the specified first test case node to obtain the target test case node queue; When the target execution mode is the full use case execution mode, based on the target node information, a forward query step traversal algorithm is used for all result use case nodes to obtain the target test case node queue; When the target execution mode is the use case execution mode associated with the specified node, based on the target node information, the forward query step traversal algorithm and the backward backtracking step traversal algorithm are used for the specified second test case node, and we obtain Target test case node queue; Wherein, the forward query step traversal algorithm is used to start from the test case node and query the preceding use case node of the test case node forward to the starting use case node; The backtracking step traversal algorithm is used to start from the test case node and query subsequent use case nodes of the test case node until the result use case node. 2. The method according to claim 1, characterized in that, after performing structured processing on each test case node according to the node relationship to obtain the target node information of each test case node, The above methods also include: Generate the test case script code of each test case node according to the target node information of each test case node; The testing according to the target test case node queue includes: Call the test case script code of the test case node in the target test case node queue to perform testing. 3. The method according to claim 1, characterized in that the target node information of each test case node includes one pre-emptive use case node. 4. The method according to claim 3, wherein determining the target execution mode includes: In the case where the function of the third test case node is changed, the target execution mode is determined to be the specified node associated use case execution mode. 5. The method according to claim 1, characterized in that, before determining the node relationship between test case nodes, the method further includes: Decompose test cases into flow charts according to the steps of the test process; Among them, each test case corresponds to a test case node in the flow chart. 6. A test device based on node relationships, characterized by including: The first determination module is used to determine node relationships between test case nodes, where the node relationships include pre-relationships and post-relationships; A structured module, configured to perform structured processing on each test case node according to the node relationship, and obtain the target node information of each test case node, where the target node information includes a prefix use case node and a current use case node. and post-use case nodes; The second determination module is used to determine the target test case node queue based on the target node information and the target step traversal algorithm; A testing module, used for testing according to the target test case node queue; Wherein, the second determination module is used to determine the target test case node queue based on the target node information and the target step traversal algorithm, Determine target execution mode; Determine the target step traversal algorithm according to the target execution mode; Wherein, the target execution mode is one of the specified use case execution mode, the full use case execution mode and the specified node associated use case execution mode; The second determination module is configured to use a forward query step traversal algorithm on the specified first test case node based on the target node information to obtain the target when the target execution mode is the specified use case execution mode. Test case node queue; When the target execution mode is the full use case execution mode, based on the target node information, a forward query step traversal algorithm is used for all result use case nodes to obtain the target test case node queue; When the target execution mode is the use case execution mode associated with the specified node, based on the target node information, the forward query step traversal algorithm and the backward backtracking step traversal algorithm are used for the specified second test case node, and we obtain Target test case node queue; The forward query step traversal algorithm is used to start from the test case node and query the preceding use case nodes of the test case node until the starting use case node; The backtracking step traversal algorithm is used to start from the test case node and query subsequent use case nodes of the test case node until the result use case node. 7. An electronic device, characterized in that it includes a processor, a memory and a program or instructions stored on the memory and executable on the processor. The program or instructions are implemented when executed by the processor. The steps of the node relationship-based testing method according to any one of claims 1-5. 8. A readable storage medium, characterized in that programs or instructions are stored on the readable storage medium, and when the programs or instructions are executed by a processor, the node-based node-based method as described in any one of claims 1-5 is implemented. Steps of the relationship testing method.