Computer software intelligent development and flowchart data structure design method

Abstract

The application discloses a computer software intelligent development and flowchart data structure design method, relates to the technical field of software automatic development and secondary development, and solves the technical problem that it is difficult to realize the event code nesting association of different windows when realizing the flowchart logic association relationship and the bottom code splicing in the prior art; the method comprises flowchart splitting and data structure design, the flowchart splitting is realized based on the connection relationship between node units, and the data structure design is realized based on the node corresponding relationship; the flowchart is divided into a plurality of flowcharts according to the layer and the level of the node units based on the characteristics of the flowchart and the set limitation conditions; the level of the flowchart division is combined with the node corresponding relationship to generate a level-layer data structure, the nesting association problem of the event codes of different windows is solved, the running speed is improved, and a large amount of storage space is avoided.

Description

Technical Field

[0001] This invention belongs to the field of software automatic development and secondary development technology, specifically a method for intelligent development of computer software and flowchart data structure design. Background Technology

[0002] In software secondary development and application software design, each step requires a large amount of code. Therefore, intelligent software writing methods are needed to replace the tedious low-level code work. By establishing a binding relationship between computer interface graphical blocks and pre-written software code, repetitive code writing can be replaced. Furthermore, the method of automatically exporting part of the code based on flowcharts can improve software development efficiency.

[0003] Currently, in the design of flowchart representations, the logical relationships of flowcharts are mainly realized through the selection and combination of HTML5 interface button components, and the underlying code is spliced ​​together. However, due to the limitations of HTML5 design rules, it is difficult to achieve nested association of event codes in different windows. Therefore, there is an urgent need for a computer software intelligent development and flowchart data structure design method. Summary of the Invention

[0004] This invention aims to solve at least one of the technical problems existing in the prior art. To this end, this invention proposes a method for intelligent development of computer software and design of flowchart data structures to solve the technical problem that it is difficult to achieve nested association of event codes in different windows when realizing the logical relationship between flowcharts and the splicing of underlying code in the prior art. This invention solves the above problem by splitting the flowchart and designing the flowchart data structure to achieve nested association of event codes in different windows.

[0005] To achieve the above objectives, an embodiment of the first aspect of the present invention proposes a method for intelligent development of computer software and flowchart data structure design, including flowchart decomposition and data structure design;

[0006] The flowchart breakdown specifically includes:

[0007] Step 11: Based on the connection relationship between the nodes in the flowchart, dynamically sort the node units into several layers, and each layer includes at least one node unit; wherein, the node unit includes the nodes and node groups in the flowchart, and the node group consists of several nodes;

[0008] Step 12: Divide the node units into several levels according to the nesting relationship between the node units in the flowchart, and determine the end node of each level;

[0009] Step 13: Decompose the flowchart by node unit layers and levels;

[0010] The data structure design specifically includes:

[0011] Step 21: Generate a tag array based on the layer and level of the node unit in the flowchart, and generate a hierarchical data structure based on the tag array;

[0012] Step 22: Subdivide the hierarchical data structure based on the node correspondence.

[0013] Preferably, in step 11, when the flowchart is divided into several layers, if a closed loop occurs in the flowchart, the layer division is based on the first loop and marked according to the number of loops, or the layers are divided in sequence and the loop nodes are repeated.

[0014] Preferably, when determining the end node in step 12, an end symbol is set for each level of the process, and the end symbol is used as an identifier for the end of that level.

[0015] Preferably, when determining the end node in step 12, the node unit with no out-degree among the node units connected to the M edges at the end of each process level is taken as the end symbol, and the end symbol is used as the identifier of the end of the level; where M≥1 and M is an integer.

[0016] Preferably, in step 13, during the flowchart splitting process, there are X levels. If there are Yi (Yi > 1) node groups within the same level Xi, then the total number of the split graphs is C, i.e.

[0017] Preferably, the node correspondence in step 22 includes sequential correspondence, numbered correspondence, conditional correspondence, sequential-conditional combination correspondence, and numbered-conditional combination correspondence; wherein, numbered correspondence means that the node unit in each layer reflects the correspondence between the node unit and the node unit in the previous layer in the form of a number.

[0018] Preferably, the sequential condition combination correspondence includes sequential correspondence and condition correspondence; the numbered condition correspondence includes number correspondence and condition correspondence.

[0019] Compared with the prior art, the beneficial effects of the present invention are:

[0020] Based on the characteristics of flowcharts and the constraints they impose, this invention divides flowcharts into several flowcharts according to the layers and levels of node units. The layers of flowchart division are combined with the node correspondences to generate a hierarchical data structure, thereby solving the problem of nested and associated event codes in different windows, improving running speed, and avoiding the waste of a large amount of storage space. Attached Figure Description

[0021] Figure 1 This is a flowchart illustrating an embodiment of the present invention. Figure 1 ;

[0022] Figure 2 This is a flowchart illustrating an embodiment of the present invention. Figure 2;

[0023] Figure 3 This is a flowchart illustrating an embodiment of the present invention. Figure 3 . Detailed Implementation

[0024] The technical solution of the present invention will be clearly and completely described below with reference to the embodiments. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0025] To address the issue of outputting complete logical relationship code in flowcharts triggered by nested pop-up windows, it is necessary to design nested code relationships and establish multiple related data structure tables. Furthermore, regarding flowchart data storage, the current main approach is to use traditional graph data structures such as adjacency lists and adjacency matrices. However, adjacency lists and adjacency matrices are designed for graphs with unordered relationships or high complexity. Flowcharts, on the other hand, have clear logical connections and primarily use sequential relationships supplemented by cyclical relationships, making them significantly more regular.

[0026] Regarding the data structure of flowcharts, it is difficult to achieve a balance between time complexity and space complexity in program execution and storage, regardless of whether adjacency matrices, adjacency lists, or cross-linked lists are used. When facing large and complex application scenarios, tens of thousands of adjacency lists or adjacency matrices will seriously affect the program's running speed and waste a lot of storage space. This invention solves the above problems by splitting the flowchart and designing the flowchart data structure to achieve nested association of event codes in different windows.

[0027] Please see Figures 1-3 This application provides a method for intelligent development of computer software and flowchart data structure design, including flowchart decomposition and data structure design;

[0028] The flowchart breakdown specifically includes:

[0029] Step 11: Based on the connection relationship between the nodes in the flowchart, dynamically sort the node units into several layers, and each layer includes at least one node unit; wherein, the node unit includes the nodes and node groups in the flowchart, and the node group consists of several nodes;

[0030] Step 12: Divide the node units into several levels according to the nesting relationship between the node units in the flowchart, and determine the end node of each level;

[0031] Step 13: Decompose the flowchart by node unit layers and levels;

[0032] The data structure design specifically includes:

[0033] Step 21: Generate a tag array based on the layer and level of the node unit in the flowchart, and generate a hierarchical data structure based on the tag array;

[0034] Step 22: Subdivide the hierarchical data structure based on the node correspondence.

[0035] In this application, when a flowchart is divided into several layers, if a closed loop occurs in the flowchart, the layer division is based on the first loop and marked according to the number of loops, or the layers are divided sequentially and the loop nodes are repeated.

[0036] This application provides two methods for determining the end node:

[0037] 1) Set an end symbol for each level of the process, and use the end symbol as an identifier for the end of that level;

[0038] 2) Take the node unit with no out-degree among the node units connected by the M edges at the end of each process level as the end symbol, and use the end symbol as the identifier of the end of the level; where M≥1 and M is an integer.

[0039] In this application, the number of flowcharts to be split can be determined based on the number of layers and levels. For example:

[0040] If there are X levels, and within the same level Xi, there are Yi (Yi > 1) node groups, then the total number of nodes in the split graph is C, i.e.

[0041]

[0042] The identification of node groups is a mechanism that pre-identifies (or determines) the number of nodes, child nodes within a node group, and the number of node groups.

[0043] In this application, a flowchart is divided into levels until the last level has no more node groups. The total number of flowcharts obtained is C; the subscript i represents the i-th level, N represents the maximum number of levels, and X represents the maximum number of levels. i Y represents the i-th level flowchart. i Represents X i The number of node groups in the hierarchical flowchart.

[0044] The intermediate-level data structure in this application consists of three parts: G i [](Storage level number), L i The set of [] (storage layer number) and GL[][] (level, layer number) is as follows: two one-dimensional arrays are used to store all level data and layer data in the flowchart respectively, and a two-dimensional array is used to store level and layer relationship data. The two-dimensional array is called the level-layer table.

[0045] For example: Table 1, Table 2, and Table 3 are the first, second, and third flowchart-level data structure tables, respectively, and Table 4 is a composite table of the above three tables.

[0046] Table 1. First-level flowchart hierarchical data structure table

[0047] Grade Floor number Node number Floor number Node number Floor number Node number Floor number Node number <![CDATA[G1]]> <![CDATA[L1]]> <![CDATA[N i ]]> <![CDATA[L2]]> <![CDATA[N i ]]> <![CDATA[L3]]> <![CDATA[N i ]]> <![CDATA[L4]]> <![CDATA[C i ]]>

[0048] Table 2. Second-level flowchart hierarchical data structure table

[0049] Grade Floor number Node number Floor number Node number Floor number Node number Floor number Node number <![CDATA[G2]]> <![CDATA[L1]]> <![CDATA[N i ]]> <![CDATA[L2]]> <![CDATA[N i ]]> <![CDATA[L3]]> <![CDATA[N i ]]> <![CDATA[L4]]> <![CDATA[C i ]]>

[0050] Table 3. Data Structure Table for Third-Level Flowchart Hierarchy

[0051] Grade Floor number Node number Floor number Node number Floor number Node number Floor number Node number <![CDATA[G3]]> <![CDATA[L1]]> <![CDATA[N i ]]> <![CDATA[L2]]> <![CDATA[N i ]]> <![CDATA[L3]]> <![CDATA[N i ]]> <![CDATA[L4]]> <![CDATA[N i ]]>

[0052] Table 4. Summary Table of Data Structure for First-Level, Second-Level, and Third-Level Flowcharts

[0053] Grade Floor number Node number Floor number Node number Floor number Node number Floor number Node number <![CDATA[G1]]> <![CDATA[L1]]> <![CDATA[N i ]]> <![CDATA[L2]]> <![CDATA[N i ]]> <![CDATA[L3]]> <![CDATA[N i ]]> <![CDATA[L4]]> <![CDATA[C i ]]> <![CDATA[G2]]> <![CDATA[L1]]> <![CDATA[N i ]]> <![CDATA[L2]]> <![CDATA[N i ]]> <![CDATA[L3]]> <![CDATA[N i ]]> <![CDATA[L4]]> <![CDATA[C i ]]> <![CDATA[G3]]> <![CDATA[L1]]> <![CDATA[N i ]]> <![CDATA[L2]]> <![CDATA[N i ]]> <![CDATA[L3]]> <![CDATA[N i ]]> <![CDATA[L4]]> <![CDATA[N i ]]>

[0054] The first-level flowchart is a node group, namely G1. The process within the node group of the first level is the second level, namely G2. The node group within the second level process is the third level process, namely G3, and so on, with the node group as the level boundary. Each level of process is divided into n (n>=1) layers, and the layer numbers are assigned according to the process order. That is, the starting node is the first layer, namely L1, the second node pointed to by the vector line is L2, that is, L2 is executed immediately after L1 is executed, and so on. Each layer can have multiple nodes, and each node can be multiple layers, but in order.

[0055] Each node has a unique number, N. i (i = 1, 2, 3, ..., N); C i (i = 1, 2, 3, ..., N) is also represented as a node, except that it contains N. i In addition to the meaning of (i = 1, 2, 3, ..., N), it can also be interpreted as a node group, and the layer number of the node group will be used as the boundary of the next level process of the node group.

[0056] When a layer contains multiple nodes, the nodes are distinguished by their numbers, i.e.: L i1 L i2 ... L iN When there are multiple nodes in n (n>=1) consecutive layers, the layer table is further subdivided and a node pairing relationship array or a mapping table is established. The node pairing relationship array or mapping table will directly reflect the association relationship between multiple nodes in consecutive layers. Each node contains p (p>=1) port numbers. Port classification examples: entrance, exit. Exits are divided into regular exits, condition judgment Y (indicating that the condition is met) exits, and condition judgment N (indicating that the condition is not met) exits.

[0057] Referring to the table above, Table 2 is a sub-process of Table 1, and its connection node is C in Table 1. i Alternatively, L1 in Table 2 can be used as the connection point between G1 and G2; Table 3 is a sub-process of Table 2, and the connection point is C in Table 2. i Alternatively, L1 in Table 3 can be used as the connection point between G2 and G3; Table 4 is equivalent to the superposition of Tables 1, 2, and 3.

[0058] Please see Figure 1 Table 5 is Figure 1 A hierarchical data structure table.

[0059] Table 5 Figure 1 Hierarchical data structure table

[0060]

[0061] In this application, the node correspondence relationship is divided into sequential correspondence, numbered correspondence, conditional correspondence, sequential conditional combination correspondence, and numbered conditional combination correspondence.

[0062] Sequential correspondence refers to the correspondence method of establishing connection relationships according to one-to-many, one-to-one, and many-to-one. For example, in Table 5, N1 in layer L1 and N2 and N3 in layer L2 have a one-to-many sequential correspondence; N2 and N3 in layer L2 and N4 and N5 in layer L3 have a one-to-one sequential correspondence, that is, the first node in layer L2 corresponds to the first node in layer L3, the second node in layer L2 corresponds to the second node in layer L3, and so on if there are other paired nodes.

[0063] Conditional correspondence refers to the correspondence between nodes based on the result of condition judgment. Conditional correspondence determines the next node in the process based on the judgment result of the judgment node.

[0064] Sequential conditional correspondence is a combined correspondence method that combines sequential correspondence and conditional correspondence, encompassing both sequential and conditional correspondences. For example, in Table 5, N4 and N5 in layer L3 and N6, N7, and N8 in layer L4 are sequential conditional correspondences, where N4 and N6 or N8 are conditional correspondences, N5 and N7 or N8 are conditional correspondences, N4 and N6 are sequential correspondences, and N5 and N7 are sequential correspondences. Similarly, in Table 5, N6, N7, and N8 in layer L4 and N4, N5, and N9 in layer L5 are sequential conditional correspondences, where N6 and N4 or N9 are conditional correspondences, N7 and N5 or N9 are conditional correspondences, N6 and N4 are sequential correspondences, and N7 and N5 are sequential correspondences.

[0065] Numbering correspondence means that each node in each layer represents its relationship with a node in the previous layer using a number. Further subdividing the nodes in Table 5 using numbers, as shown in Table 6, corresponds to number C. ij(i = 0, 1, 2, ..., N; j = 0, 1, 2, ..., N), where only one number (i) is in the index to indicate that the node is the starting node, i = 0 indicates the first node, i = 1 indicates the second node, and so on; j = 0 indicates that the node corresponds to the i = 0th node in the previous layer.

[0066] Table 6: Number Correspondence Display Table

[0067] Floor number Node number Corresponding number Node number Corresponding number Node number Corresponding number <![CDATA[L1]]> <![CDATA[N1]]> <![CDATA[C0]]> <![CDATA[L2]]> <![CDATA[N2]]> <![CDATA[C 00 ]]> <![CDATA[N3]]> <![CDATA[C 10 ]]> <![CDATA[L3]]> <![CDATA[N4]]> <![CDATA[C 00 ]]> <![CDATA[N5]]> <![CDATA[C 11 ]]> <![CDATA[L4]]> <![CDATA[N6]]> <![CDATA[C 00 ]]> <![CDATA[N7]]> <![CDATA[C 11 ]]> <![CDATA[N8]]> <![CDATA[C 201 ]]> <![CDATA[L5]]> <![CDATA[N4]]> <![CDATA[C 00 ]]> <![CDATA[N5]]> <![CDATA[C 11 ]]> <![CDATA[N9]]> <![CDATA[C 12 ]]>

[0068] Please see Figure 2 ,Will Figure 2 Converted into an adjacency matrix, as shown in Tables 7 and 8, N1 and N2 in the tables correspond to... Figure 2 Node 1, Node 2, and so on, as shown in Table 7. Figure 2 The left-hand diagram contains the node groups, as shown in Table 8. Figure 2 The right-hand diagram is the sub-process nested in node group 5 of the left-hand diagram; 0 indicates no connection, and 1 indicates a connection.

[0069] Table 7 Figure 2 The adjacency matrix data structure table in the left-hand diagram

[0070] node <![CDATA[N1]]> <![CDATA[N2]]> <![CDATA[N3]]> <![CDATA[N4]]> <![CDATA[N5]]> <![CDATA[N6]]> <![CDATA[N1]]> 0 1 0 0 0 0 <![CDATA[N2]]> 0 0 1 0 0 0 <![CDATA[N3]]> 0 0 0 1 1 0 <![CDATA[N4]]> 0 0 0 0 0 1 <![CDATA[N5]]> 0 0 0 0 0 1 <![CDATA[N6]]> 0 0 0 0 0 0

[0071] Table 8 Figure 2 The adjacency matrix data structure table on the right side

[0072] node <![CDATA[N1]]> <![CDATA[N2]]> <![CDATA[N3]]> <![CDATA[N4]]> <![CDATA[N5]]> <![CDATA[N6]]> <![CDATA[N1]]> 0 1 0 0 0 0 <![CDATA[N2]]> 0 0 1 0 0 0 <![CDATA[N3]]> 0 0 0 1 1 0 <![CDATA[N4]]> 0 0 0 0 0 1 <![CDATA[N5]]> 0 0 0 0 0 1 <![CDATA[N6]]> 0 0 0 0 0 0

[0073] As can be seen from Tables 7 and 8 above, the cells with a value of 1 contain useful information. Obviously, the adjacency matrix wastes memory and disk space for cells with a value of 0, and adds useless traversal operations for cells with a value of 0.

[0074] An adjacency list implements a graph structure by combining a sequential list and a linked list to establish relationships between vertex and edge nodes. The node structure storing each vertex consists of two parts: a data field and a pointer field. The data field stores vertex data, and the pointer field links to the next node. The adjacency list is used for storage. Figure 2 As shown in Tables 9 and 10:

[0075] Table 9 Figure 2 The left-hand diagram corresponds to the adjacency list.

[0076]

[0077] Table 10 Figure 2 The right-hand diagram corresponds to the adjacency list.

[0078]

[0079]

[0080] The principle of a cross-linked list is similar to that of an adjacency list. The difference is that in a cross-linked list, non-zero elements linked in the same row form a linear linked list, and non-zero elements linked in the same column form a linear list. Each non-zero element is a node in both a row and a column linked list. The entire matrix forms a cross-shaped linked list. Figure 1 The two flowcharts in the diagram are connected vertically only by node groups. Although the cross-linked list is better than the adjacency list in this flowchart, the cross-linked list is also redundant, which reduces the efficiency of operation. At the same time, the cross-linked list also has the complex and redundant disadvantages of the adjacency list when applied to a regular flowchart.

[0081] Table 11 describes the hierarchical data structure. Figure 2 It has a clear structure, combines the advantages of adjacency matrices, adjacency lists, and linked lists, and overcomes the shortcomings of each of them. It is designed based on the rules of flowcharts, which saves memory, reduces running time, and improves computational efficiency.

[0082] Table 11: Level 11 Hierarchical Data Structure

[0083]

[0084] Please see Figure 3 The entire flowchart in its initial state is divided into node groups, which are considered as level one. The initial number of node groups is 1. Figure 3 All node groups are at level two, and so on. Nested node groups within a node group will be treated as a single node at that level. n is the number of node groups in the secondary process, m plus 1, i.e., n = m + 1. The area within the dashed box represents the same-level hierarchical structure, i.e., determining the connection relationship between two nodes, dynamically sorting nodes (including node groups) according to their connection relationships in the flowchart, dividing them into first, second, third, ... levels, and so on. The number of nodes in the same level is Xi (Xi >= 1). This ultimately establishes a completely new flowchart data structure, creating a graph-level table bounded by levels; and a layer-level table bounded by layers. A graph-level table and multiple layer-level tables can be merged into a single graph-level layer-level table. In practical applications, connections are further established based on node ports (e.g., the inflow and outflow ports of regular nodes, and the inflow, Y-outflow, N-outflow, and return ports of nodes determined by a for loop). Figure 3 Each rectangle with a number represents a node. A solid arrow between two nodes indicates the flow sequence between the nodes, with the arrow pointing to the next flow node. A dashed arrow between two nodes indicates a mapping relationship, meaning that the data of the node starting with the dashed line is mapped to the node pointed to by the arrow. Figure 3The Latin letters Y and N represent the condition judgment results of the nodes they lead to, where Y indicates that the condition is met and N indicates that the condition is not met.

[0085] Figure 3 The specific meanings of Chinese Arabic numerals are as follows:

[0086] 1. Begin;

[0087] 2. Data preprocessing: Classify data according to set identifiers: node class and node group class; when both nodes and node groups appear (parallel relationship), a node group is treated as one node by default.

[0088] 3. Node group hierarchical (G) for (i = 1, i <= n, i++);

[0089] 4. Create a one-dimensional array A i ;

[0090] 5. Create a two-dimensional array B i ;

[0091] 6. Create a one-dimensional array C i ;

[0092] 7. Import node data (including node groups, with each node group being treated as a single node) into a one-dimensional array A. i ;

[0093] 8. Import the directed edge data into the two-dimensional array B i ;

[0094] 9. Import node group data into a one-dimensional array C i ;

[0095] 10. Set array A i B i The element is of level i;

[0096] 11. Determine if the i-th level node group has been traversed;

[0097] 12 G = G + 1;

[0098] 13. Create array CA i ;

[0099] 14. Create array CB i ;

[0100] 15. Import elements of array A into array CA i ;

[0101] 16. Import elements of array B into array CB i ;

[0102] 17. The for statement loops through hierarchical nodes: for(x=1,x<=K,x++), K=N,N is the number of Gi-level nodes (including node groups);

[0103] 18. Establish G i A table that shows connections between N nodes;

[0104] 19. The for statement loops through the node groups in a hierarchical manner: for(y=1,y<=K,y++), K=N,N is the number of Gi-level nodes (including node groups);

[0105] 20 Establish G i A table that shows connections between node x and N nodes;

[0106] 21. The if statement determines the connection relationship between Lx and Ly;

[0107] 22. Establish layer number + node number;

[0108] 23. Establish level number + layer number;

[0109] 24. Create a hierarchical table;

[0110] 25. Create a hierarchical table;

[0111] 26. Establish a flowchart-level master table;

[0112] 27. End.

[0113] The data in the above formula are all calculated by removing the dimensions and taking the numerical values. The formula is the closest to the real situation obtained by software simulation of a large amount of collected data. The preset parameters and preset thresholds in the formula are set by those skilled in the art according to the actual situation or obtained through simulation of a large amount of data.

[0114] The above embodiments are only used to illustrate the technical methods of the present invention and are not intended to limit it. Although the present invention has been described in detail with reference to preferred embodiments, those skilled in the art should understand that modifications or equivalent substitutions can be made to the technical methods of the present invention without departing from the spirit and scope of the technical methods of the present invention.

Claims

1. A method for intelligent development and flowchart data structure design of computer software, characterized in that, This includes flowchart decomposition and data structure design; The flowchart breakdown specifically includes: Based on the dynamic sorting of the connection relationships between flowchart nodes, the node units are divided into several layers, and each layer includes at least one node unit; wherein, the node unit includes nodes and node groups in the flowchart, and the node group consists of several nodes; The node units are divided into several levels according to the nesting relationship between the node units in the flowchart, and the ending node of each level is determined. A flowchart decomposed by node units into layers and levels; The data structure design specifically includes: A tag array is generated based on the layer and level of the node unit in the flowchart, and a level-layer data structure is generated based on the tag array; the level-layer data structure includes a one-dimensional array storing level numbers, a one-dimensional array storing layer numbers, and a two-dimensional array storing level-layer mapping relationships; When dividing a flowchart into several layers, if a closed loop occurs in the flowchart, the layer division is based on the first loop and marked according to the number of loops, or the layers are divided in sequence and the loop nodes are repeated. The hierarchical data structure is subdivided based on node correspondences; wherein, the node correspondences include sequential correspondence, numbered correspondence, conditional correspondence, sequential-conditional combination correspondence, and numbered-conditional combination correspondence; the sequential correspondence is a correspondence method that establishes connections according to one-to-many, one-to-one, and many-to-one relationships; the numbered correspondence refers to the correspondence between node units in each layer and node units in the previous layer being represented by numbers; the conditional correspondence is a correspondence method that establishes connections between nodes according to the results of conditional judgments; the conditional correspondence is based on the judgment results of judgment-type nodes determining the next node in the process; the sequential-conditional combination correspondence includes both sequential correspondence and conditional correspondence; the numbered-conditional combination correspondence includes both numbered correspondence and conditional correspondence.

2. The computer software intelligent development and flowchart data structure design method according to claim 1, characterized in that, When determining the end node, set an end symbol for each level of the process, and use the end symbol as an identifier for the end of that level.

3. The computer software intelligent development and flowchart data structure design method according to claim 1, characterized in that, When determining the end node, the node with no out-degree among the node units connected to the M edges at the end of each process level is taken as the end symbol, and the end symbol is used as the identifier of the end of that level; where M≥1 and M is an integer.

Images