A one-key Kr desulfurization data processing method and apparatus based on multi-layer directed graphs

Abstract

A method and apparatus for processing one-click KR desulfurization data based on a multi-layer directed graph are disclosed. The method includes: obtaining information related to the one-click KR desulfurization process from a server database, including the process flow and dynamic data within the process; processing the obtained data into a multi-layer directed graph data structure according to preset rules; and displaying the directed graph in a multi-layer overlay manner on the interface according to user needs. This invention not only offers good data flexibility but also good applicability and scalability. The front-end server can dynamically display different one-click desulfurization steps based on this data structure, while the back-end server can reduce access pressure, improve data reading efficiency, and reduce the time cost of large-scale data retrieval. Under the same data volume conditions, it reduces data processing time, improves page switching speed, and enhances the overall system operating efficiency.

Description

Technical Field

[0001] This invention relates to the field of data processing, and in particular to a one-click KR desulfurization data processing method and apparatus based on a multi-layer directed graph. Background Technology

[0002] Currently, there are generally two methods for tracking and displaying data in the one-click KR desulfurization production process. The first method is to encapsulate the data of the entire process from the arrival of molten iron at the station, through temperature measurement, slag removal, feeding, to the departure of molten iron from the station, into an object, and then extract the data from the object one by one for displaying the data of each step in the one-click KR desulfurization production process. The second method is to perform several data retrieval operations in the database according to the module division, and then display the retrieved data in the corresponding module.

[0003] However, the first approach has the following drawbacks: Encapsulating data into an object can lead to backend data retrieval lag, increased data complexity for frontend programmers, and if even one piece of data fails to retrieve correctly, the entire production data tracking and display process cannot be completed, resulting in an empty page. The second approach, which involves retrieving data multiple times based on module division, can cause server system crashes, and data synchronization issues can arise between multiple modules during continuous page refreshes. Summary of the Invention

[0004] In view of the above problems, the present invention is proposed to provide a one-key KR desulfurization data processing method and apparatus based on a multi-layer directed graph that overcomes or at least partially solves the above problems.

[0005] To address the aforementioned technical problems, the embodiments of this application disclose the following technical solutions:

[0006] A one-click Kr desulfurization data processing method based on multi-layer directed graphs includes:

[0007] S100. Retrieve information related to the one-click KR desulfurization process from the server database, including the process flow and dynamic data within the process;

[0008] S200. Process the acquired data into a multi-layered directed graph data structure according to preset rules;

[0009] S300. Based on user requirements and the processed multi-layered directed graph data structure, the directed graph is displayed in the interface using a multi-layered overlay method.

[0010] Furthermore, in S200, the method for processing the acquired data into a multi-layered directed graph data structure according to preset rules includes:

[0011] S201. Determine the number of layers and the data in each layer of the multi-layer directed graph data structure; based on the obtained one-click KR desulfurization process flow and the type of dynamic data in the process, determine whether the process flow and the dynamic data in the process belong to the fixed process layer or the dynamic data layer respectively.

[0012] S202. For the fixed process layer, establish a class adjacency matrix;

[0013] S203. For the dynamic data layer, establish a class adjacency matrix of the same size as the fixed process layer;

[0014] S204. Enter data at the fixed process layer and the dynamic process layer, and determine the mapping relationship of data in the multiple layers;

[0015] S205. Output the adjacency matrix data structure corresponding to the multi-level directed graph.

[0016] Furthermore, in S201, the fixed process layer includes at least: molten iron tilting car, molten iron temperature measurement and sampling node, ladle node, stirring head, feeding node, and molten iron slag removal; the dynamic data layer includes: position data indicating the molten iron tilting car's entry and exit from the station, molten iron temperature measurement and sampling data, ladle return and tilting angle data, stirring head height data and whether it is in standby position, feeding-related parameters, and slag removal-related data.

[0017] Furthermore, in S201, if the obtained process flow and dynamic data in the process have types other than fixed processes and dynamic data, then the number of layers of the multi-level directed graph data structure is increased.

[0018] Furthermore, in S202, a class adjacency matrix is ​​established for the fixed process layer. The main diagonal of the class adjacency matrix stores special node data. The structure of this node data is [name, data, z, flag], where name is the node name, data is the parameter value of the node, z is the layer number of the node in the directed graph, and flag is optional and controls the state of the node. The main diagonal of the class adjacency matrix is ​​used to store process nodes; the off-diagonal of the class adjacency matrix stores bool type edge data.

[0019] Furthermore, in S203, for the dynamic data layer, a class adjacency matrix of the same size as the fixed process layer is established. The storage structure on the main diagonal of the class adjacency matrix is ​​[name, data, z, flag], where name is the node name, data is the parameter value of the node, z is the layer number of the node in the directed graph, and flag is optional and controls the state of the node. The main diagonal of the class adjacency matrix is ​​used to store dynamic data; the off-diagonal stores boolean type edge data.

[0020] Furthermore, in S300, when the user's requirement is to preview the simulation event of the one-click KR desulfurization process, the data processing method is as follows:

[0021] Obtain information on the one-click KR desulfurization process and the sequence of procedures, as well as the information dynamically displayed when the process is executed normally in sequence;

[0022] Establish a fixed process layer and a dynamic data layer with corresponding relationships, and construct a class adjacency matrix in each of the two layers;

[0023] In the fixed process layer, the main diagonal storage structure of the adjacency matrix is ​​[name, data, z, flag]. Name is the process node name, data is the parameter value over a period of time, which can change, z is the layer number, and flag controls whether the node is currently being executed. In the fixed process layer, the non-main diagonal of the adjacency matrix stores boolean type edge data.

[0024] In the dynamic data layer, the storage structure on the main diagonal of the adjacency matrix is ​​[name, data, z, flag], which stores dynamic data. On the non-main diagonal of the adjacency matrix in the dynamic data layer, the edge is stored to indicate whether it is currently being executed.

[0025] Simulate the changes in specific data of KR desulfurization in a normal process, modify the data in the adjacency matrix, and reconstruct multiple different multi-layer directed graphs based on the changes in the data in the adjacency matrix.

[0026] Output multiple different multi-layered directed graphs in sequence, and highlight the processes being executed in the one-click KR desulfurization simulation event in turn, dynamically displaying the real-time data of the step.

[0027] Furthermore, in S300, when the user's requirement is to display the one-click KR desulfurization process for certain steps, the data processing method is as follows:

[0028] Obtain process information and dynamic data of some steps in the one-click KR desulfurization process;

[0029] Establish a fixed process layer and a dynamic data layer with corresponding relationships, and construct a class adjacency matrix in each of the two layers;

[0030] In the fixed process layer, the main diagonal storage structure of the adjacency matrix is ​​[name, data, z, flag]. Name is the node name, data is the parameter value over a period of time, which can change, z is the layer number, and flag controls whether the node is displayed. In the non-main diagonal of the adjacency matrix in the fixed process layer, edge boolean type data is stored.

[0031] In the dynamic data layer, the class adjacency matrix stores dynamic data in the structure [name, data, z, flag] on the main diagonal. No data is stored on the non-main diagonal of the class adjacency matrix in the dynamic data layer.

[0032] Based on the two adjacency matrices from the previous two steps, and combined with the flag field to control the display of nodes, a multi-layered directed graph for this instance is formed.

[0033] Output a multi-layered directed graph with virtual nodes to display the KR desulfurization process in one click.

[0034] This invention also discloses a one-click KR desulfurization data processing device based on a multi-layer directed graph, comprising: an acquisition module, and a data processing and output module for a multi-layer directed graph data structure; wherein:

[0035] The acquisition module is used to retrieve information related to the one-click KR desulfurization process from the server database, including the process flow and dynamic data in the process.

[0036] The module for establishing nodes and adjacency matrices is used to serialize the acquired directed graph information according to the data structure [name, data, z, flag]. This structure is the internal structure for storing node information in the directed graph. `name` is the node name, `data` is the parameter value of the node, `z` is the layer number of the node in the directed graph, and `flag` is optional, controlling the display of nodes as needed. It is also used to store node information at the positions on the main diagonal of the adjacency matrix, according to the node structure specified in the node module. Edge information is stored at other positions on the non-main diagonal of the adjacency matrix; a value of 1 indicates the presence of a directed edge, and a value of 0 indicates the absence of one.

[0037] Establish a multi-level adjacency matrix module to form a single-level adjacency matrix by combining nodes and edges of the same level, and to form a multi-level adjacency matrix module by combining nodes and edges of multiple levels.

[0038] The multi-layer directed graph conversion module is used to convert adjacency matrices into directed graphs. The adjacency matrices in the fixed process layer and the dynamic data layer are converted into directed graphs respectively to form a multi-layer directed graph. If it is necessary to merge the display, the fixed process layer and the dynamic data layer are merged into a single directed graph through different layers and the same directed graph node positions.

[0039] The output module is used to output multi-level directed graphs according to actual application requirements.

[0040] The beneficial effects of the above-described technical solutions provided in the embodiments of the present invention include at least the following:

[0041] This invention discloses a one-key Kr desulfurization data processing method based on multi-layer directed graphs, comprising:

[0042] The server database retrieves information related to the one-click KR desulfurization process, including the process flow and dynamic data within the process. The retrieved data is processed into a multi-layered directed graph data structure according to preset rules. Based on user needs, the multi-layered directed graph data structure is displayed on the interface using a multi-layered overlay method. This invention not only handles data with good flexibility but also offers good applicability and scalability. The front-end server can dynamically display different one-click desulfurization steps based on this data structure, while the back-end server can reduce access pressure, improve data reading efficiency, and reduce the time cost of large-scale data retrieval. Under the same data volume conditions, it reduces data processing time, improves page switching speed, and enhances the overall system operating efficiency.

[0043] The technical solution of the present invention will be further described in detail below with reference to the accompanying drawings and embodiments. Attached Figure Description

[0044] The accompanying drawings are provided to further illustrate the invention and form part of the specification. They are used in conjunction with embodiments of the invention to explain the invention and do not constitute a limitation thereof. In the drawings:

[0045] Figure 1 This is a flowchart of a one-click KR desulfurization data processing method based on a multi-layer directed graph in Embodiment 1 of the present invention.

[0046] Figure 2 This is a flowchart of a method for processing acquired data into a multi-layered directed graph data structure according to preset rules in Embodiment 1 of the present invention.

[0047] Figure 3 In Embodiment 2 of the present invention, when the user's requirement is to preview the simulated events of the one-click KR desulfurization process, the flowchart of the one-click KR desulfurization data processing method is shown.

[0048] Figure 4 In Embodiment 3 of the present invention, when the user requires a demonstration of one-click KR desulfurization for certain processes, the flowchart of the one-click KR desulfurization data processing method is shown.

[0049] Figure 5 This is a structural diagram of a one-key KR desulfurization data processing device based on a multi-layer directed graph, as shown in Embodiment 4 of the present invention. Detailed Implementation

[0050] Exemplary embodiments of the present disclosure will now be described in more detail with reference to the accompanying drawings. While exemplary embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure may be implemented in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosure to those skilled in the art.

[0051] To address the problems existing in the prior art, embodiments of the present invention provide a one-click KR desulfurization data processing method and apparatus based on multi-layer directed graphs.

[0052] Example 1

[0053] This embodiment discloses a one-key Kr desulfurization data processing method based on multi-layer directed graphs, such as... Figure 1 ,include:

[0054] S100. Retrieve information related to the one-click KR desulfurization process from the server database, including the process flow and dynamic data within the process;

[0055] Specifically, the KR (Kambara Reactor) desulfurization method was invented by Nippon Steel in 1963 by the Guangzhou Tobacco Factory to limit the use of magnesium. It was applied to industrial production in 1965. The KR method involves immersing a cross-shaped stirring head, cast with refractory material and baked, into the molten iron ladle to a certain depth. The vortex generated by its rotation draws a weighed desulfurizing agent, fed through a feeder, onto the surface of the molten iron. This agent is then drawn into the molten iron by the vortex, ensuring thorough contact and reaction between the calcium oxide-based desulfurizing powder and the molten iron, thus achieving desulfurization.

[0056] S200. Process the acquired data into a multi-layered directed graph data structure according to preset rules; in S200 of this embodiment, the method for processing the acquired data into a multi-layered directed graph data structure according to preset rules is as follows: Figure 2 include:

[0057] S201. Determine the number of layers and the data in each layer of the multi-layer directed graph data structure; based on the obtained one-click KR desulfurization process flow and the type of dynamic data in the process, determine whether the process flow and the dynamic data in the process belong to the fixed process layer or the dynamic data layer; specifically, the fixed process layer includes at least: molten iron tilting car, molten iron temperature sampling node, ladle node, stirring head, feeding node, and molten iron slag removal; the dynamic data layer includes: position data indicating the molten iron tilting car's entry and exit from the station, molten iron temperature sampling data, ladle return and tilting angle data, stirring head height data and whether it is in standby position, feeding-related parameters, and slag removal-related data.

[0058] If the obtained process flow and dynamic data in the process have types other than fixed processes and dynamic data, then the number of layers of directed graph data structure should be increased.

[0059] S202. For a fixed process layer, a class adjacency matrix is ​​established. In S202 of this embodiment, a class adjacency matrix is ​​established for a fixed process layer. The main diagonal of the class adjacency matrix stores special node data. The structure of the node data is [name, data, z, flag], where name is the node name, data is the parameter value of the node, z is the layer number of the node in the directed graph, and flag is optional and controls the state of the node. The main diagonal of the class adjacency matrix is ​​used to store process nodes. The non-main diagonal of the class adjacency matrix stores bool type edge data.

[0060] S203. For the dynamic data layer, establish a class adjacency matrix of the same size as the fixed process layer; In S203 of this embodiment, for the dynamic data layer, establish a class adjacency matrix of the same size as the fixed process layer. The storage structure on the main diagonal of the class adjacency matrix is ​​[name, data, z, flag], where name is the node name, data is the parameter value of the node, z is the layer number of the node in the directed graph, and flag is optional and controls the state of the node. The main diagonal of the class adjacency matrix is ​​used to store dynamic data; the off-diagonal stores bool type edge data.

[0061] S204. Enter data on the fixed process layer and the dynamic process layer, and determine the mapping relationship of data in the multiple layers; specifically, enter data and determine the mapping relationship of data in the multiple layers. Although in this embodiment, the data is classified and stored on different layers, it may need to be displayed simultaneously on the final page. Therefore, when entering data on the fixed process layer and the dynamic process layer, the mapping relationship of the data needs to be considered so as to achieve the two-in-one display in the future.

[0062] S205. Output the adjacency matrix data structure corresponding to the multi-level directed graph.

[0063] S300. Based on user requirements and the processed multi-layered directed graph data structure, the directed graph is displayed in the interface using a multi-layered overlay method.

[0064] This embodiment discloses a one-click Kr desulfurization data processing method based on multi-layer directed graphs, including:

[0065] The server database retrieves information related to the one-click KR desulfurization process, including the process flow and dynamic data within the process. The retrieved data is processed into a multi-layered directed graph data structure according to preset rules. Based on user needs, the multi-layered directed graph data structure is displayed on the interface using a multi-layered overlay method. This invention not only handles data with good flexibility but also offers good applicability and scalability. The front-end server can dynamically display different one-click desulfurization steps based on this data structure, while the back-end server can reduce access pressure, improve data reading efficiency, and reduce the time cost of large-scale data retrieval. Under the same data volume conditions, it reduces data processing time, improves page switching speed, and enhances the overall system operating efficiency.

[0066] Example 2

[0067] Based on the one-click KR desulfurization data processing method based on a multi-layer directed graph in Example 1, when the user's requirement is to preview the simulated events of the one-click KR desulfurization process, such as... Figure 3 The data processing method is as follows:

[0068] Obtain information on the one-click KR desulfurization process and the sequence of procedures, as well as the information dynamically displayed when the process is executed normally in sequence.

[0069] First, based on the general method in Example 1, establish a fixed process layer and a dynamic data layer with corresponding relationships, and construct a class adjacency matrix in each of the two layers;

[0070] A class adjacency matrix (with a flag indicating whether it is currently executing) is stored on the main diagonal of the class adjacency matrix in the fixed process layer. The storage structure is [name, data, z, flag], where name is the process node name, data is the parameter value over a period of time (which can change), z is the layer number, and flag controls whether the node is currently executing. Edge data (bool type) is stored on the non-main diagonal of the class adjacency matrix in the fixed process layer.

[0071] The adjacency matrix of the dynamic data layer (with a flag indicating whether it is currently executing). The main diagonal of the adjacency matrix in the dynamic data layer stores the structure [name, data, z, flag], which stores dynamic data. The off-diagonal sections of the adjacency matrix store whether an edge is currently executing (bool type, subsequent edges are highlighted).

[0072] The changes in specific data of KR desulfurization under normal process are simulated, that is, the data in the adjacency matrix are changed, and multiple different multi-layer directed graphs are reconstructed based on the changes in the data in the adjacency matrix.

[0073] Outputs multiple different multi-layered directed graphs sequentially. Functionality includes: sequentially highlighting the processes being executed in a one-click KR desulfurization simulation event, and dynamically displaying real-time data for each step;

[0074] This embodiment is based on a one-click KR desulfurization data processing method based on a multi-layer directed graph, which is common in Embodiment 1. When the user needs to preview the simulation event of the one-click KR desulfurization process, the method of Embodiment 1 is optimized to realize the purpose of dynamically displaying the real-time data of the process being executed in the one-click KR desulfurization simulation event.

[0075] Example 3

[0076] Based on the one-click KR desulfurization data processing method based on multi-layer directed graphs in Example 1, when the user's requirement is to display the one-click KR desulfurization process for a portion of the steps, such as... Figure 4 The data processing method is as follows:

[0077] Obtain process information and dynamic data information for some steps in the one-click desulfurization process;

[0078] First, based on the general method in Example 1, establish a fixed process layer and a dynamic data layer with corresponding relationships, and construct a class adjacency matrix in each of the two layers;

[0079] In the fixed process layer, there is a class adjacency matrix (with a display flag). The main diagonal storage structure is [name, data, z, flag], where name is the node name, data is the parameter value over a period of time (which can change), z is the layer number, and flag controls whether the node is displayed. The non-main diagonal of the class adjacency matrix in the fixed process layer stores edge data (bool type).

[0080] The class adjacency matrix of the dynamic data layer (with a display flag). The main diagonal of the class adjacency matrix in the dynamic data layer stores dynamic data as [name, data, z, flag]. Data is not stored on the non-main diagonal sections of the class adjacency matrix in the dynamic data layer.

[0081] Combine them into a multi-level directed graph with virtual nodes. Based on the two adjacency matrices from the previous two steps, and combined with the flag field to control the display of nodes, combine them into a multi-level directed graph for this instance. It should be noted that if a process node is not displayed in a fixed process layer, the corresponding dynamic data will also not be displayed. In practice, virtual nodes are used instead, so as not to destroy the original priority graph structure.

[0082] Output a multi-layered directed graph with virtual nodes. This example enables the display of some processes in the KR desulfurization process with a single click.

[0083] This embodiment is based on a one-click KR desulfurization data processing method based on a multi-layer directed graph, which is common in Embodiment 1. When the user needs to display some processes of one-click KR desulfurization, the method of Embodiment 1 is optimized to achieve the purpose of displaying some processes of one-click KR desulfurization.

[0084] Example 4

[0085] Based on Embodiment 1, this embodiment discloses a one-key KR desulfurization data processing device based on a multi-layer directed graph, such as 5, comprising:

[0086] The device comprises an acquisition module 401, a node and class adjacency matrix establishment module 402, a multi-level class adjacency matrix establishment module 403, a multi-level directed graph transformation module 404, and an output module 405.

[0087] Acquisition module 401: Acquire all the necessary process flows, dynamic data, and other information that constitutes a complete directed graph;

[0088] Module 402 establishes a node and adjacency matrix. The node module serializes the acquired directed graph information according to the data structure [name, data, z, flag]. This structure is the internal structure for storing node information in the directed graph (the node structure on the main diagonal of the directed graph). `name` is the node name, `data` is the parameter value of the node, `z` is the layer number of the node in the directed graph, and `flag` is optional, controlling the display of nodes as needed. A basic adjacency matrix storing only edge information is constructed based on the number of nodes. However, here, we store node information on the main diagonal positions of the adjacency matrix, according to the node structure specified in the node module; edge information is stored on other non-main diagonal positions of the adjacency matrix, with a value of 1 if a directed edge exists and 0 otherwise. This new adjacency matrix is ​​called a quasi-adjacency matrix.

[0089] Establish a multi-level adjacency matrix module 403; nodes and edges at the same level form a single-level adjacency matrix, and multiple levels form a multi-level adjacency matrix module;

[0090] Multi-layer directed graph conversion module 404; We need to convert adjacency matrices into directed graphs. The adjacency matrices in the fixed process layer and the dynamic data layer are converted into directed graphs respectively, forming a multi-layer directed graph. If it is necessary to merge them for display, the fixed process layer and the dynamic data layer are merged into a single directed graph through different layers and the same directed graph node positions.

[0091] Output module 405; according to actual application requirements, the output format is a multi-layer directed graph.

[0092] It should be understood that the specific order or hierarchy of steps in the disclosed process is an example of an exemplary method. Based on design preferences, it should be understood that the specific order or hierarchy of steps in the process may be rearranged without departing from the scope of this disclosure. The appended method claims provide elements of various steps in an exemplary order and are not intended to limit the scope to the specific order or hierarchy described.

[0093] In the detailed description above, various features are combined together in a single embodiment to simplify this disclosure. This approach to disclosure should not be construed as reflecting an intention that embodiments of the claimed subject matter require more features than are explicitly stated in each claim. Rather, as reflected in the appended claims, the invention is presented with fewer features than all of the features in a single disclosed embodiment. Therefore, the appended claims are hereby explicitly incorporated into the detailed description, with each claim representing a separate preferred embodiment of the invention.

[0094] Those skilled in the art will also understand that the various illustrative logic blocks, modules, circuits, and algorithm steps described in conjunction with the embodiments herein can be implemented as electronic hardware, computer software, or a combination thereof. To clearly illustrate the interchangeability between hardware and software, the various illustrative components, blocks, modules, circuits, and steps described above are generally described in terms of their functionality. Whether such functionality is implemented as hardware or software depends on the specific application and the design constraints imposed on the overall system. Those skilled in the art can implement the described functionality in alternative ways for each specific application; however, such implementation decisions should not be construed as departing from the scope of this disclosure.

[0095] The steps of the methods or algorithms described in conjunction with the embodiments herein can be directly embodied in hardware, software modules executed by a processor, or a combination thereof. The software modules can reside in RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, hard disks, removable disks, CD-ROMs, or any other form of storage medium well known in the art. An exemplary storage medium is connected to the processor, enabling the processor to read information from and write information to the storage medium. Of course, the storage medium can also be a component of the processor. The processor and storage medium can reside in an ASIC. The ASIC can reside in a user terminal. Alternatively, the processor and storage medium can exist as discrete components in the user terminal.

[0096] For software implementation, the techniques described in this application can be implemented using modules (e.g., procedures, functions, etc.) that perform the functions described in this application. This software code can be stored in memory units and executed by a processor. The memory units can be implemented within the processor or outside the processor; in the latter case, they are communicatively coupled to the processor via various means, as is well known in the art.

[0097] The foregoing description includes examples of one or more embodiments. It is certainly impossible to describe all possible combinations of components or methods in order to describe the above embodiments, but those skilled in the art will recognize that further combinations and arrangements of the various embodiments are possible. Therefore, the embodiments described herein are intended to cover all such changes, modifications, and variations that fall within the scope of the appended claims. Furthermore, the term "comprising" as used in the specification or claims is interpreted in a manner similar to the term "including," as interpreted when used as a conjunction in the claims. Additionally, the use of any term "or" in the specification of the claims is intended to mean "non-exclusive or."

Claims

1. A one-key Kr desulfurization data processing method based on multi-layer directed graphs, characterized in that, include: S100. Retrieve information related to the one-click KR desulfurization process from the server database, including the process flow and dynamic data within the process; S200. Process the acquired data into a multi-level directed graph data structure according to preset rules; S200 includes the following methods for processing the acquired data into a multi-level directed graph data structure according to preset rules: S201. Determine the number of layers and the data in each layer of the multi-layer directed graph data structure; based on the obtained one-click KR desulfurization process flow and the type of dynamic data in the process, determine whether the process flow and the dynamic data in the process belong to the fixed process layer or the dynamic data layer; the fixed process layer includes at least: molten iron tilting car, molten iron temperature sampling node, ladle node, stirring head, feeding node, and molten iron slag removal; the dynamic data layer includes: data indicating the position of the molten iron tilting car entering and leaving the station, molten iron temperature sampling data, ladle return and tilting angle data, stirring head height data and whether it is in the standby position, feeding-related parameters, and slag removal-related data; S202. For the fixed process layer, establish a class adjacency matrix; S203. For the dynamic data layer, establish a class adjacency matrix of the same size as the fixed process layer; S204. Enter data at the fixed process layer and the dynamic process layer, and determine the mapping relationship of data in the multiple layers; S205. Output the adjacency matrix data structure corresponding to the multi-level directed graph; S300. Based on user needs and the processed multi-layered directed graph data structure, the directed graph is displayed in the interface in a multi-layered overlay manner; When the user's requirement is to display the one-click KR desulfurization process for certain steps, the data processing method is as follows: Obtain process information and dynamic data information for some steps in the one-click desulfurization process; Establish a fixed process layer and a dynamic data layer with corresponding relationships, and construct a class adjacency matrix in each of the two layers; In the fixed process layer, the main diagonal storage structure of the adjacency matrix is ​​[name, data, z, flag]. Name is the node name, data is the parameter value over a period of time, which can change, z is the layer number, and flag controls whether the node is displayed. In the non-main diagonal of the adjacency matrix in the fixed process layer, edge boolean type data is stored. In the dynamic data layer, the class adjacency matrix stores dynamic data in the structure [name, data, z, flag] on the main diagonal. No data is stored on the non-main diagonal of the class adjacency matrix in the dynamic data layer. Based on the two adjacency matrices from the above steps, and combined with the flag field to control the display of nodes, a multi-layered directed graph is formed. Output a multi-layered directed graph with virtual nodes to display the KR desulfurization process in one click.

2. The one-key Kr desulfurization data processing method based on multi-layer directed graphs as described in claim 1, characterized in that, In S201, if the obtained process flow and dynamic data in the process have types other than fixed process and dynamic data, then the number of multi-level directed graph data structure layers is increased.

3. The one-key Kr desulfurization data processing method based on multi-layer directed graphs as described in claim 1, characterized in that, In S202, a class adjacency matrix is ​​established for a fixed process layer. The main diagonal of the class adjacency matrix stores special node data. The structure of this node data is [name, data, z, flag], where name is the node name, data is the parameter value of the node, z is the layer number of the node in the directed graph, and flag is optional and controls the state of the node. The main diagonal of the class adjacency matrix is ​​used to store process nodes; the off-diagonal of the class adjacency matrix stores boolean type edge data.

4. The one-key Kr desulfurization data processing method based on multi-layer directed graphs as described in claim 1, characterized in that, In S203, for the dynamic data layer, a class adjacency matrix of the same size as the fixed process layer is established. The storage structure on the main diagonal of the class adjacency matrix is ​​[name, data, z, flag]. Name is the node name, data is the parameter value of the node, z is the layer number of the node in the directed graph, and flag is optional and controls the state of the node. The main diagonal of the class adjacency matrix is ​​used to store dynamic data; the off-diagonal stores boolean type edge data.

5. The one-key Kr desulfurization data processing method based on multi-layer directed graphs as described in claim 1, characterized in that, When the user's requirement is to preview the simulated events of the one-click KR desulfurization process, the data processing method is as follows: Obtain information on the one-click KR desulfurization process and the sequence of procedures, as well as the information dynamically displayed when the process is executed normally in sequence; Establish a fixed process layer and a dynamic data layer with corresponding relationships, and construct a class adjacency matrix in each of the two layers; In the fixed process layer, the main diagonal storage structure of the adjacency matrix is ​​[name, data, z, flag]. Name is the process node name, data is the parameter value over a period of time, which can change, z is the layer number, and flag controls whether the node is currently being executed. In the fixed process layer, the non-main diagonal of the adjacency matrix stores boolean type edge data. In the dynamic data layer, the storage structure on the main diagonal of the adjacency matrix is ​​[name, data, z, flag], which stores dynamic data. On the non-main diagonal of the adjacency matrix in the dynamic data layer, the edge is stored to indicate whether it is currently being executed. Simulate the changes in specific data of KR desulfurization in a normal process, modify the data in the adjacency matrix, and reconstruct multiple different multi-layer directed graphs based on the changes in the data in the adjacency matrix. Output multiple different multi-layered directed graphs in sequence, and highlight the processes being executed in the one-click KR desulfurization simulation event in turn, dynamically displaying the real-time data of the step.

6. A one-key KR desulfurization data processing device based on a multi-layer directed graph, employing the processing method described in any one of claims 1-5, characterized in that, include: The acquisition module is a data processing and output module for multi-level directed graph data structures; among which: The acquisition module is used to retrieve information related to the one-click KR desulfurization process from the server database, including the process flow and dynamic data in the process. The module for establishing nodes and adjacency matrices is used to serialize the acquired directed graph information according to the data structure [name, data, z, flag]. This structure is the internal structure for storing node information in the directed graph. `name` is the node name, `data` is the parameter value of the node, `z` is the layer number of the node in the directed graph, and `flag` is optional, controlling the display of nodes as needed. It is also used to store node information at the positions on the main diagonal of the adjacency matrix, according to the node structure specified in the node module. Edge information is stored at other positions on the non-main diagonal of the adjacency matrix; a value of 1 indicates the presence of a directed edge, and a value of 0 indicates the absence of one. Establish a multi-level adjacency matrix module to form a single-level adjacency matrix by combining nodes and edges of the same level, and to form a multi-level adjacency matrix module by combining nodes and edges of multiple levels. The multi-layer directed graph conversion module is used to convert adjacency matrices into directed graphs. The adjacency matrices in the fixed process layer and the dynamic data layer are converted into directed graphs respectively to form a multi-layer directed graph. If it is necessary to merge the display, the fixed process layer and the dynamic data layer are merged into a single directed graph through different layers and the same directed graph node positions. The output module is used to output multi-level directed graphs according to actual application requirements.

Images