System combat ring traversing method based on ALLCYCLES function
Through the ALLCYCLES function traversal method, the problem of the inability to determine the node composition and length limitation of the combat ring in the existing technology is solved, and the combat ring traversal and optimization in complex environments is realized, providing intuitive traversal results and node composition information, supporting Accurate strategy and resource allocation.
Patent Information
- Application Number
- CN202410988568.2
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-23
- Publication Date
- 2024-11-15
AI Technical Summary
Although the existing combat ring traversal method based on the adjacency matrix can accurately calculate the number of combat rings in the system, it cannot determine the specific node composition of each combat ring. It is limited by the length of the combat ring and cannot be in a complex and changeable military environment. Provide accurate strategic and tactical optimization and resource allocation support.
Using the system combat ring traversal method based on ALLCYCLES function, the network topology model is constructed and mapped to a directed graph by abstracting combat nodes and links. The allcycles function is used to traverse and visualize the combat ring, which avoids the lengthy matrix calculation process and can accurately calculate it. The nodes of each combat ring are composed.
It realizes accurate traversal of combat rings in complex military environments, provides intuitive traversal results, facilitates subsequent combat network planning and optimization, enhances the protection capabilities of key nodes, and is suitable for future complex battlefield environments.
Smart Images

Figure CN118965722A_ABST
Abstract
Description
Technical Field
[0001] The invention relates to a system combat loop traversal method based on an ALLCYCLES function, and belongs to the technical field of system effectiveness evaluation. Background Art
[0002] The origin of the concept of "combat loop" can be traced back to the OODA (Observation, Orientation, Decision, Action) theory proposed by John Boyd, a colonel of the US Air Force in the 1960s. The introduction of this concept provides a new perspective for understanding and optimizing combat processes. Entering the information age, the OODA loop plays an increasingly important role. The future battlefield environment will become more complex and changeable, including synchronous operations in the physical domain (land, sea, air, space) and the non-physical domain (network, information environment). "OODA-based fast to eat slow" has become an important winning mechanism in the information age and a supporting idea for conceptual innovation in the information age.
[0003] The general process of the combat loop is: after discovering the enemy target, the reconnaissance node passes the target information to the decision-making node, the decision-making node analyzes the target information, forms combat orders and combat plans, and the attack node effectively strikes the enemy target after receiving the combat order. In view of the complexity of modern warfare, a complete combat activity requires the participation of multiple reconnaissance and decision-making entities. Therefore, there is information sharing between reconnaissance nodes, and decision-making nodes also include the combat coordination of multiple command entities. The existence of information sharing and collaborative command links increases the number of system combat loops.
[0004] The number of combat loops is a basic indicator of combat loops. The calculation of the number of system combat loops is not a simple numerical statistic, but directly reflects the structural complexity and network robustness of the combat system. Therefore, in the future complex battlefield environment, accurately and quickly traversing the system combat loops is of irreplaceable importance for formulating accurate strategies and tactics, optimizing resource allocation, and predicting combat results.
[0005] Many scholars have verified the effectiveness and practicality of various combat loop traversal methods by constructing combat loop models and conducting simulation analysis based on actual cases. For example, in "Identification Method of Important Nodes in Combat System Network Based on OODA Loop", Yang Qian and Fang Yanhong proposed an OODA combat loop search method based on the VF3 algorithm. In "Combat loop recommendation method based on integrated improved ant colony algorithm", Li Jie and Tan Yuejin proposed an integrated improved ant colony algorithm that can achieve efficient and high-quality combat loop recommendation optimization solution. In "Combat system node importance evaluation based on combat loop", Yi Xiaodi, Fan Changjun, Huang Kuihua and others combined the topological graph loop search method to design an improved depth-first search algorithm based on the IDFCS model to traverse the combat loop in the system. Overall, the most used method is the combat loop calculation method based on the adjacency matrix mentioned in the literature such as "A combat system effectiveness evaluation method based on combat loop" and "Weapon equipment system contribution evaluation based on combat loop".
[0006] In today's complex and ever-changing military environment, combat rings are of great significance for optimizing combat strategies and improving combat effectiveness. The number of combat rings is a basic indicator of combat rings, which directly reflects the structural complexity and network robustness of the combat system. Starting from the network topology model based on the combat ring, this patent establishes a mapping relationship between the combat network topology model and the directed graph, and proposes a system combat ring traversal method based on the allcycles function based on the directed graph. Compared with the traditional method of using the adjacency matrix to calculate the number of combat rings, this method avoids the lengthy process of calculating the adjacency matrix, and can simply and intuitively traverse the combat rings in the system, which can provide a reference for future traversal optimization, system optimization, and performance evaluation based on combat rings. Summary of the invention
[0007] The traditional method is based on a mathematical model - the adjacency matrix. First, the adjacency matrix is constructed according to the combat network. By calculating the kth power of the adjacency matrix, the number of combat rings with a corresponding length of k is obtained. Then, the number of all combat rings is added together to obtain the number of combat rings in the system. The traditional method of calculating combat rings based on the adjacency matrix can accurately calculate the number of combat rings in the system, but it cannot determine which nodes each combat ring contains, and is limited by the length of the combat ring.
[0008] The technical problem to be solved by the present invention is generally to provide a traversal method for the system combat ring based on the ALLCYCLES function. Starting from the network topology model based on the combat ring, a mapping relationship between the combat network topology model and the directed graph is established. Based on the directed graph, a search and traversal method for the system combat ring based on the allcycles function is proposed. The method can accurately obtain the number of combat rings in the system and can also calculate the component nodes of each combat ring. At the same time, the traversal results can be highlighted in the system in the form of a subgraph, which provides a more intuitive basis for subsequent combat network planning and design, adjustment of node positions, optimization of connection relationships, and enhancement of the protection capabilities of key nodes.
[0009] To solve the above problems, the technical solution adopted by the present invention is:
[0010] A method for traversing a system combat cycle based on the ALLCYCLES function includes the following steps: first, abstracting combat nodes and combat links; then, constructing a network topology model based on the combat cycle; second, mapping it to a directed graph; and third, traversing the combat cycle for visualization.
[0011] Step S1: abstract the combat nodes;
[0012] Determine the combat objectives according to the combat mission, clarify the composition of our weapons and equipment system participating in the combat, and abstract the combat units and platforms into nodes in the combat ring according to the differences in the functions performed by the combat units and platforms during the combat process; the nodes include target nodes, reconnaissance nodes, decision nodes and attack nodes;
[0013] The nodes in the system are represented by
[0014] |V Node |={T,S,D,I} Formula (1);
[0015] Among them, T represents the target node, which refers to various entities of military value of the enemy in the battlefield space and is an important target of our combat operations;
[0016] S means using reconnaissance equipment as reconnaissance nodes. Reconnaissance nodes include radars, satellites, reconnaissance aircraft, and early warning aircraft. Reconnaissance nodes are used to perceive battlefield situations and pass the collected information to decision nodes to assist in decision-making.
[0017] D stands for decision-making node, which is our platform responsible for war command. Decision-making nodes receive intelligence information from various reconnaissance nodes through the communication network, standardize target information through data format conversion, encrypted information decryption, multi-source information fusion and other technologies, and analyze and judge it. According to information such as the type, number, location, and possible action intention of the target, threat assessment is conducted on the target. Based on the real-time battlefield situation and combat needs, combat decisions are made, combat orders are issued, and changes in the battlefield situation are continuously monitored. Combat orders are adjusted in a timely manner according to actual conditions. Finally, feedback information is received from various combat units to evaluate combat effectiveness.
[0018] I represents an attack node, which is a combat unit used to receive instructions from decision-making nodes and directly carry out fire strikes on enemy targets. The combat unit includes weapon systems and combat platforms.
[0019] Step S2: The combat link is abstracted as the edge of the node;
[0020] After the combat nodes are determined in step S1, the association relationship between the combat link nodes is clarified according to the communication capabilities, communication protocols, network topology, etc. of each node. The association relationship represents the channel for information flow between nodes. The channel for information flow between two nodes is abstracted as a link in the combat ring; the link is divided into information sharing flow, intelligence upload flow, collaborative command flow and firepower strike flow.
[0021] In step S2, the association relationships between nodes include reconnaissance relationship (T→S), decision relationship (S→D), command relationship A (D→S), command relationship B (D→I), strike relationship (I→T), link relationship of information sharing relationship (S→S) and collaborative command relationship (D→D);
[0022] |V Edge |={E TS , E SD , E DS , E DI , E IT , E SS , E DD} Formula (2);
[0023] Among them, the link relationship (S→S) represents the information sharing link between two different reconnaissance nodes; the decision relationship (S→D) represents the intelligence upload link from the reconnaissance node to the command and control node; the command relationship A (D→S) represents the command issuance link from the command and control node to the reconnaissance and surveillance node; the collaborative command relationship (D→D) represents the collaborative command link between any two command and control nodes; the command relationship B (D→I) represents the command issuance link from the command and control node to the firepower strike node; the reconnaissance relationship (T→S) represents the reconnaissance detection link from the reconnaissance node to the enemy target; the strike relationship (I→T) represents the firepower strike link from the attack node to the enemy target.
[0024] Step S3, after completing the construction of the nodes and links in steps S1 and S2, a combat system targeting the enemy target is constructed according to the preset combat mission, and combat nodes in the combat system are extracted based on the structural framework of the combat ring;
[0025] The operational network topology model is defined as
[0026] Q=(Node,Edge) formula (3);
[0027] Node is the set of all combat nodes in the combat system; Edge is the set of edges connecting combat unit nodes in the combat system.
[0028] Step S4, mapping to a directed graph; according to the mapping relationship between the combat network and the directed graph, presenting the combat network topology model in the form of a directed graph;
[0029] In a link relationship shown in formula (2), the previous node transmits information or data to the next node through the link. In this link relationship, the previous node is the output node and the next node is the input node. For example, when the output node is a reconnaissance node such as a sensor or radar in the intelligence upload link, the input node is the decision node; when the output node is a strike node such as a weapon launch platform in the firepower strike link, the input node is the enemy target.
[0030] First, the input nodes and output nodes in the combat network are mapped to the vertices with in-degree and the vertices with out-degree in the directed graph respectively; then, the link relationship in the combat network is mapped to the edges in the directed graph; secondly, the directed graph representing the combat network of the system is output;
[0031] Again, define the directed graph as:
[0032] G=digraph(Q) formula (4);
[0033] Where Q is the combat network topology model including combat nodes and link relationships.
[0034] Step S5, traversing the combat ring;
[0035] Based on step 4, take the directed graph as input and traverse all combat cycles in the graph based on the allcycles function;
[0036] First, the function is defined as:
[0037] allcycles(G)=[cycles, edgecycles] formula (5);
[0038] Where cycles represents all cycles in the directed graph, which is output in the form of a cell array, where the content of each cell array is all the nodes that form a cycle. Similarly, edgecycles corresponds to all the edges in cycles.
[0039] In step S5, for all loops, a subgraph array is constructed based on the tiledlayout function, all combat loops in the directed graph are distinguished by different colors and presented in the form of subgraphs.
[0040] In step S3, the nodes of the combat system and the information transmission direction relationship between the nodes include a target node T, four reconnaissance nodes S1, S2, S3, S4, three decision nodes D1, D2, D3, and four strike nodes I1, I2, I3, I4;
[0041] The reconnaissance node S discovers and identifies the target node T, and transmits the information of the target node T to the decision node D. The decision node D makes a judgment and transmits the target information and instruction information to the attack node I. The attack node I launches an attack on the target node T.
[0042] Among them, the reconnaissance node S2 shares the target information with the reconnaissance node S3; the decision node D2 shares the instruction information with the decision node D1;
[0043] The nodes and links in step S3 are input into formula (3) and formula (4) to generate a directed graph mapped by the system combat network.
[0044] A traversal system of a system combat loop based on the ALLCYCLES function includes a network topology model based on the combat loop; and a network topology model is established based on the above method.
[0045] The beneficial effects of the present invention are:
[0046] 1. Based on the combat ring theory, this method can traverse the combat ring in the system by inputting combat nodes and links, avoiding the lengthy process of building the adjacency matrix calculation. There is no self-circulation or the same ring is calculated multiple times, and the traversal result is more accurate.
[0047] 2. This method can visualize the traversal results and highlight each combat loop in the system in the form of a subgraph, which can provide military commanders with more intuitive combat loop traversal results.
[0048] 3. Compared with the traditional adjacency matrix and algorithm, this method is not limited by the length of the combat ring, and can find out which nodes each combat ring contains, which facilitates the subsequent adjustment and optimization of the combat ring structure.
[0049] 4. For underwater combat systems, considering that underwater acoustic communication is difficult and greatly affected by the environment, each combat loop has great differences, and an intuitive combat loop traversal method is more needed. Therefore, this method has certain applicability for the analysis of the combat loops of underwater systems. In the future, it can provide support for the loop extraction and optimization recommendation of underwater combat systems according to underwater combat needs and environmental characteristics. BRIEF DESCRIPTION OF THE DRAWINGS
[0050] Figure 1 This is the process of the present invention.
[0051] Figure 2 It is a network topology structure model diagram of the present invention.
[0052] Figure 3 It is the directed graph of the system combat network of the present invention.
[0053] Figure 4 It is the combat ring highlighting sub-picture of the present invention.
[0054] Figure 5 It is a correlation diagram between the combat link nodes of the present invention.
[0055] Figure 6 It is a search result graph of the present invention.
[0056] Figure 7 It is a link relationship table diagram between nodes of the present invention.
[0057] Figure 8 It is a mapping relationship table diagram between the combat network and the directed graph of the present invention. DETAILED DESCRIPTION
[0058] like Figure 1 This is a flowchart of the system combat cycle traversal method based on the allcycles function, such as Figure 2It is the relationship between the nodes of a combat system and the information transmission direction between the nodes, including a target node T, four reconnaissance nodes S1, S2, S3, S4, three decision nodes D1, D2, D3, and four attack nodes I1, I2, I3, I4. The reconnaissance node discovers and identifies the target, passes the target information to the decision node, the decision node makes a judgment, and passes the target and command information to the attack node, which launches an attack on the target node T. Among them, the reconnaissance node S2 can share the target information with the reconnaissance node S3; the decision D2 can share the command information with the decision D1.
[0059] according to Figure 2 The combat system shown can be obtained as follows Figure 5 The table shows the relationship between the nodes.
[0060] By inputting the relationship between nodes and links into formula (3) and formula (4), a directed graph mapped out of a certain system combat network can be generated, such as Figure 3 shown.
[0061] The relationship between nodes and edges in the network topology model reflects the information transmission relationship of the combat system. Based on the allcycles function, all cycles are searched as follows: Figure 6 result;
[0062] Based on the tiledlayout function, Figure 4 , and highlight each loop in the diagram.
[0063] like Figure 1-8 , the specific embodiments of this patent are as follows:
[0064] Step 1: Abstract the combat nodes
[0065] Determine the combat objectives according to the combat mission, clarify the composition of our weapons and equipment system participating in the combat, and abstract them into four types of nodes in the combat loop: target type, reconnaissance type, decision type, and attack type according to the differences in the execution functions of various combat units, platforms or systems during the combat process;
[0066] The nodes in the system are represented by
[0067] |V Node |={T,S,D,I} Formula (1);
[0068] Among them, T represents target nodes, which usually refer to various entities of military value to the enemy in the battlefield space. These entities have an important impact on the enemy's combat capability and are important targets of our combat operations. S represents reconnaissance nodes, which mainly include radars, satellites, reconnaissance aircraft, early warning aircraft and other reconnaissance equipment, which are used to perceive the battlefield situation and pass the collected information to decision-making nodes as an important basis for auxiliary decision-making. D represents decision-making nodes, which are our platform responsible for war command. They can receive, analyze and process intelligence information from various reconnaissance nodes, and make scientific and reasonable decisions based on real-time battlefield situation and combat needs; I represents attack nodes, which are combat units used to receive instructions from decision-making nodes and directly carry out fire strikes on enemy targets, including various weapon systems and combat platforms.
[0069] Step 2: Abstract the operational chain
[0070] After determining the combat nodes, analyze the associations between the nodes in the combat loop, and abstract the relationships between the nodes with information flow into links in the network. Specifically, they can be divided into: information sharing flow, intelligence upload flow, collaborative command flow, firepower strike flow, etc. There are 7 common node relationships:
[0071] |V Edge |={E TS , E SD , E DS , E DI , E IT , E SS , E DD} (2)
[0072] Reconnaissance relationship (T→S), decision-making relationship (S→D), command relationship A (D→S), command relationship B (D→I), strike relationship (I→T), information sharing relationship (S→S), and coordinated command relationship (D→D). See Table 1 for detailed explanation.
[0073] Step 3: Build a combat network topology model
[0074] According to the combat mission, a combat system targeting enemy targets is constructed. Based on the structural framework of the combat ring, the combat nodes in the system are extracted, including the target node T, the reconnaissance node S, the decision node D, and the attack node I; the combat links in the system are extracted, including the information sharing link S→S, the intelligence upload link S→D, the command upload link D→S, the collaborative command and control link D→D, the command issuance link D→I, the reconnaissance and detection link T→S, the firepower strike link I→T, etc.
[0075] The operational network topology model is defined as
[0076] Q=(Node,Edge) (3)
[0077] Node is the set of all nodes in the combat system; Edge is the set of edges connecting the combat unit nodes in the combat system.
[0078] Step 4: Mapping to a directed graph
[0079] Traditional combat network topology modeling methods often fail to fully reflect the directed connection characteristics between nodes in combat networks, such as command relationships, data flows, etc. Therefore, the introduction of directed graphs as a data structure can more accurately describe the complexity and dynamics of combat networks. Each combat unit in the combat network is mapped to a vertex in a directed graph, and the combat link relationship is mapped to an edge in a directed graph, thereby constructing a corresponding directed graph model. This mapping relationship not only helps to deeply understand the essential characteristics of combat networks, but also provides strong theoretical and tool support for the optimization design and practical application of combat networks. The mapping relationship between combat networks and directed graphs is shown in the table below. Figure 7 shown.
[0080] According to the mapping relationship between the combat network and the directed graph, the combat network topology model is presented in the form of a directed graph. The input and output nodes in the combat network are mapped to the vertices with in-degree and the vertices with out-degree in the directed graph respectively; the various link relationships in the combat network are mapped to the edges in the directed graph, and finally the directed graph that can represent the system combat network is output.
[0081] Define a directed graph as:
[0082] G = digraph(Q) (4)
[0083] Where: Q is the combat network topology model including combat nodes and link relationships.
[0084] Step 5: Traverse the combat loop
[0085] Based on step 4, all combat cycles in the graph are traversed based on the allcycles function.
[0086] The function is defined as:
[0087] allcycles(G)=[cycles,edgecycles] (5)
[0088] In the formula: cycles represents all cycles in the directed graph, which are output in the form of cell arrays, where the content of each cell array is all the nodes that form a cycle. Similarly, edgecycles corresponds to all the edges in cycles. Output the results and visualize them, highlighting all combat cycles in the directed graph and presenting them as subgraphs.
[0089] The present invention is fully described for a clearer disclosure, and the prior art is not listed one by one.
[0090] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit them; although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or replace some of the technical features therein with equivalents; it is obvious for those skilled in the art to combine multiple technical solutions of the present invention. However, these modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the present invention. The technical contents not described in detail in the present invention are all known technologies.
Claims
1. A method for traversing a system combat cycle based on the ALLCYCLES function, characterized in that: The method comprises the following steps: First, abstract combat nodes and combat links; Then, a network topology model based on the combat ring is constructed; secondly, it is mapped to a directed graph; Again, traverse the combat ring and visualize it.
2. The traversal method of the system combat loop based on the ALLCYCLES function according to claim 1 is characterized in that: Step S1: abstract the combat nodes; Determine the combat objectives according to the combat mission, clarify the composition of our weapons and equipment system participating in the combat, and abstract the combat units and platforms into nodes in the combat ring according to the differences in the functions performed by the combat units and platforms during the combat process; the nodes include target nodes, reconnaissance nodes, decision nodes and attack nodes; The nodes in the system are represented by lVvodel={T,S,D,I}Formula (1); Among them, T represents the target node, which refers to various entities of military value of the enemy in the battlefield space and is an important target of our combat operations; S means using reconnaissance equipment as reconnaissance nodes. Reconnaissance nodes include radars, satellites, reconnaissance aircraft, and early warning aircraft. Reconnaissance nodes are used to perceive battlefield situations and pass the collected information to decision nodes to assist in decision-making. D represents the decision-making node, which is our platform responsible for war command. The decision-making node receives intelligence information from various reconnaissance nodes through the communication network, and performs standardized processing and analysis of target information through data format conversion, encrypted information decryption, and multi-source information fusion. According to the type, number, location, and action intention information of the target node, the target node is evaluated for threat, and based on the real-time battlefield situation and combat requirements, combat decisions are made, combat orders are issued, and battlefield situation changes are continuously monitored and combat orders are adjusted. Finally, feedback information is received from various combat units to evaluate combat effectiveness. I represents an attack node, which is a combat unit used to receive instructions from decision-making nodes and directly carry out fire strikes on enemy targets. The combat unit includes weapon systems and combat platforms.
3. The traversal method of the system combat cycle based on the ALLCYCLES function according to claim 1, characterized in that: Step S2: The combat link is abstracted as the edge of the node; After the combat nodes are determined in step S1, the association relationship between the combat link nodes is determined according to the communication capability, communication protocol, and network topology of each node. The association relationship represents the channel for information flow between the nodes, and the channel for information flow between two nodes is abstracted as a link in the combat ring; The links are divided into information sharing flow, intelligence upload flow, collaborative command and control flow, and firepower strike flow.
4. The method for traversing the system combat loop based on the ALLCYCLES function according to claim 3 is characterized in that: In step S2, the association relationships between nodes include reconnaissance relationship (T→S), decision relationship (S→D), command relationship A (D→S), command relationship B (D→I), strike relationship (I→T), link relationship of information sharing relationship (S→S) and collaborative command relationship (D→D); Vsdge|={Ers, Esp, Eps, Epr, E, Ess, Epp} formula (2); Among them, the link relationship (S→S) represents the information sharing link between two different reconnaissance nodes; the decision relationship (S→D) represents the intelligence upload link from the reconnaissance node to the command and control node; the command relationship A (D→S) represents the command issuance link from the command and control node to the reconnaissance and surveillance node; the collaborative command relationship (D→D) represents the collaborative command link between any two command and control nodes; the command relationship B (D→I) represents the command issuance link from the command and control node to the firepower strike node; the reconnaissance relationship (T→S) represents the reconnaissance detection link from the reconnaissance node to the enemy target; the strike relationship (I→T) represents the firepower strike link from the attack node to the enemy target.
5. The method for traversing the system combat loop based on the ALLCYCLES function according to claim 4 is characterized in that: Step S3, after completing the construction of the nodes and links in steps S1 and S2, a combat system targeting the enemy target is constructed according to the preset combat mission, and combat nodes in the combat system are extracted based on the structural framework of the combat ring; The operational network topology model is defined as Q=(Node,Edge) formula (3); Node is the set of all combat nodes in the combat system; Edge is the set of edges connecting combat unit nodes in the combat system.
6. The method for traversing the system combat cycle based on the ALLCYCLES function according to claim 5, characterized in that: Step S4, mapping to a directed graph; according to the mapping relationship between the combat network and the directed graph, presenting the combat network topology model in the form of a directed graph; In the link relationship shown in formula (2), the previous node transmits information or data to the next node through the link. In this link relationship, the previous node is the output node and the next node is the input node. For example, when the output node is a reconnaissance node, the input node is a decision node; When the output node is the attack node, the input node is the enemy target. First, the input nodes and output nodes in the combat network are mapped to the vertices with in-degree and the vertices with out-degree in the directed graph respectively; Then, the link relationships in the combat network are mapped to edges in a directed graph; secondly, a directed graph representing the combat network of the system is output; Again, define the directed graph as: G=digraph(Q) formula (4); Where Q is the combat network topology model including combat nodes and link relationships.
7. The method for traversing the system combat loop based on the ALLCYCLES function according to claim 6 is characterized in that: Step S5, traversing the combat ring; Based on step 4, take the directed graph as input and traverse all combat cycles in the graph based on the allcycles function; First, the function is defined as: allcycles(G)=[cycles, edgecycles] formula (5); Where cycles represents all cycles in the directed graph, which is output in the form of a cell array, where the content of each cell array is all the nodes that form a cycle. Similarly, edgecycles corresponds to all the edges in cycles.
8. The method for traversing the system combat loop based on the ALLCYCLES function according to claim 7, characterized in that: In step S5, for all loops, a subgraph array is constructed based on the tiledlayout function, all combat loops in the directed graph are distinguished by different colors and presented in the form of subgraphs.
9. The method for traversing the system combat cycle based on the ALLCYCLES function according to claim 8, characterized in that: In step S3, the nodes of the combat system and the information transmission direction relationship between the nodes include a target node T, four reconnaissance nodes S1, S2, S3, S4, three decision nodes D1, D2, D3, and four strike nodes I1, I2, I3, I4; The reconnaissance node S discovers and identifies the target node T, and transmits the information of the target node T to the decision node D. The decision node D makes a judgment and transmits the target information and instruction information to the attack node I. The attack node I launches an attack on the target node T. Among them, the reconnaissance node S2 shares the target information with the reconnaissance node S3; the decision node D2 shares the instruction information with the decision node D1; The nodes and links in step S3 are input into formula (3) and formula (4) to generate a directed graph mapped by the system combat network.
10. A traversal system of the system combat cycle based on the ALLCYCLES function, characterized by: Including a network topology model based on a combat ring; establishing a network topology model based on the method described in claim 8.
