Ship piping string washing circuit connection method and device, storage medium and terminal

Abstract

The application discloses a kind of ship piping string washing circuit connection method and device, storage medium and terminal, wherein the method comprises: constructing undirected graph model randomly selecting one as departure vertex and current vertex;Determine whether the current vertex exists connected vertex, if there is, then the connected vertex is used as preliminary vertex to form set, determine whether preliminary vertex set contains departure vertex, if contains, then determine whether the number of vertex in searched path is greater than preset number, if yes, then connect departure vertex to current searched path to obtain string washing circuit path;If the current vertex has no connected vertex, then determine whether the current vertex exists cross-connectable vertex, if there is, then all cross-connectable vertices of the current vertex are used as preliminary vertex, and all preliminary vertex sets are preliminary vertex set.The method of the application avoids manually finding cross-connection scheme on complex piping schematic diagram, greatly improves production efficiency and accuracy.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of ship testing, in particular to a ship pipe system series washing loop connection method and device, a storage medium and a terminal. BACKGROUND

[0002] There are usually a large number of complex pipe systems inside a ship to ensure the supply of navigation fuel, lubricating oil, steam, etc., and the different flow media in the pipe system also have different technical requirements for the pipe system itself. During the mooring trial before the delivery of the ship, the cleaning series washing of various pipe systems is an important test content, and usually requires a long test period, especially for some special flow media, which often have high cleaning degree acceptance standards.

[0003] The existing ship pipe system series washing connection often needs to be designed manually, that is, professional staff needs to design the loop connection for a large number of pipe systems to be washed, which is a cumbersome process, has a large amount of work, and is prone to design errors, and at the same time, the design scheme is limited, and the longest series washing loop cannot be obtained. SUMMARY

[0004] The technical problem to be solved by the present application is that the existing ship series washing loop needs to be designed manually, the process is cumbersome, the amount of work is large, and design errors are prone to occur, and the design scheme obtained is limited.

[0005] To solve the above technical problems, the present application provides a ship pipe system series washing loop connection method, comprising:

[0006] Step one: constructing an undirected graph model based on all pipe systems to be washed in the ship system;

[0007] Step two: randomly selecting a vertex from the undirected graph model as a starting vertex, taking the starting vertex as a current vertex and including it in the searched path;

[0008] Step three: determining whether the current vertex has a connected vertex, if so, taking all connected vertices of the current vertex as preliminary vertices, and collecting all the preliminary vertices into a preliminary vertex set, otherwise executing step seven;

[0009] Step four: determining whether the preliminary vertex set contains the starting vertex, if so, executing step five, otherwise executing step six;

[0010] Step five: determining whether the number of vertices in the searched path is greater than a preset number, if so, connecting the starting vertex to the searched path to obtain a series washing loop path and recording, and executing step eight, otherwise excluding the starting vertex from the preliminary vertex set;

[0011] Step six: judging whether the preliminary vertices in the preliminary vertex set are all in the current searched path, if yes, executing step seven, otherwise, randomly selecting one from the preliminary vertices in the preliminary vertex set which are not in the searched path to connect to the searched path, taking the selected preliminary vertex as a new current vertex, and executing step three;

[0012] Step seven: judging whether the current vertex has crossable vertices, if yes, taking all the crossable vertices of the current vertex as preliminary vertices, and taking all the preliminary vertex set as a preliminary vertex set, and then executing step four, otherwise, executing step eight;

[0013] Step eight: ending the connection.

[0014] Preferably, the ship pipeline series washing circuit connection method further comprises:

[0015] Step nine: representing the series washing circuit path in the form of an adjacency matrix, wherein the adjacency sub-matrix of the adjacency matrix is composed of the crossable vertices in the series washing circuit path, and the adjacency sub-matrix is a sub-matrix on the main diagonal line of the adjacency matrix.

[0016] Preferably, all the pipelines to be washed in series are part of the pipelines or all the pipelines in the ship system.

[0017] Preferably, the connected vertex is a vertex directly connected to the current vertex through a non-directed edge.

[0018] Preferably, in the undirected graph model, the ports of each pipe section in the pipeline to be washed in series, the preset flow equipment and the multi-pipe collection point are taken as vertices in the undirected graph model, the pipe sections connecting the vertices are taken as undirected edges, and all the vertices are grouped based on a preset grouping condition.

[0019] Preferably, in step seven, the crossable vertex of the current vertex is determined by a crossable condition.

[0020] The crossable condition is:

[0021] The same group as the current vertex and not as a crossable vertex of other vertices;

[0022] The straight-line distance from the current vertex is not more than a preset distance.

[0023] Preferably, the preset number is 2.

[0024] To solve the above technical problems, the application further provides a ship pipeline series washing circuit connection device, comprising:

[0025] The algorithm comprises an undirected graph generating module, a starting vertex setting module, an adjacent vertex judging module, a starting vertex judging module, a searched path vertex number judging module, a searched path judging module, a crossable vertex judging module and an algorithm ending module;

[0026] The undirected graph generating module is configured to construct an undirected graph model based on all to-be-washed pipes in a ship system.

[0027] The starting vertex setting module is configured to randomly select a vertex from the undirected graph model as a starting vertex, take the starting vertex as a current vertex and include the starting vertex into a searched path.

[0028] The adjacent vertex judging module is configured to judge whether the current vertex has adjacent vertices, if yes, take all adjacent vertices of the current vertex as preliminary vertices, and collect all the preliminary vertices into a preliminary vertex set, otherwise, transmit the current vertex to the crossable vertex judging module.

[0029] The starting vertex judging module is configured to judge whether the starting vertex is included in the preliminary vertex set, if yes, transmit the preliminary vertex set to the searched path vertex number judging module, otherwise, transmit the preliminary vertex set to the searched path judging module.

[0030] The searched path vertex number judging module is configured to judge whether the number of vertices in the searched path is greater than a preset number, if yes, connect the starting vertex to the searched path to obtain a washing loop path and record the washing loop path, and then transmit the starting vertex to the ending connection module, otherwise, remove the starting vertex from the preliminary vertex set.

[0031] The searched path judging module is configured to judge whether all the preliminary vertices in the preliminary vertex set are in the searched path, if yes, transmit the current vertex to the crossable vertex judging module, otherwise, randomly select one preliminary vertex from the preliminary vertices not in the searched path and connect the preliminary vertex to the searched path, take the selected preliminary vertex as a new current vertex, and transmit the new current vertex to the adjacent vertex judging module.

[0032] The crossable vertex judging module is configured to judge whether the current vertex has crossable vertices, if yes, take all crossable vertices of the current vertex as preliminary vertices, and collect all the preliminary vertices into a preliminary vertex set, and then transmit the preliminary vertex set to the starting vertex judging module, otherwise, transmit the current vertex to the ending connection module.

[0033] The ending connection module is configured to end the connection.

[0034] To solve the above technical problems, the application further provides a storage medium, which stores a computer program, and the program is executed by a processor to realize the ship piping system string washing loop connection method

[0035] To solve the above technical problems, the application further provides a terminal, comprising: a processor and a memory in communication connection with the processor;

[0036] The memory is used for storing a computer program, and the processor is used for executing the computer program stored in the memory, so that the terminal executes the ship piping system string washing loop connection method.

[0037] Compared with the prior art, one or more embodiments of the above scheme can have the following advantages or beneficial effects:

[0038] The ship piping system string washing loop connection method provided by the embodiment of the application abstracts the originally complex ship piping system into an undirected graph mathematical model, determines the adjacency relationship of each vertex in the undirected graph through the existing pipe sections of the original piping system, and the piping system designer only needs to clearly define the constraint conditions of the system cleaning string washing cross connection, so that a series of cross connection schemes meeting the requirements can be obtained through multiple implementations of the method, thereby avoiding manual searching for the cross connection scheme on the complex piping system schematic diagram, and greatly improving the production efficiency and accuracy, thereby providing necessary technical support for shortening the period of system cleaning test.

[0039] Other features and advantages of the application will be set forth in the following description, and in part will become apparent to those skilled in the art from the description, or can be learned by practice of the application. The objects and other advantages of the application will be realized and achieved by the structure particularly pointed out in the description, claims and drawings. BRIEF DESCRIPTION OF DRAWINGS

[0040] The accompanying drawings are included to provide a further understanding of the application and constitute a part of the specification, which together with the application embodiments, serve to explain the application, and do not constitute a limitation on the application. In the drawings:

[0041] Figure 1 A flowchart of a ship piping system string washing loop connection method according to an embodiment of the application is shown;

[0042] Figure 2 An implementation process diagram of a ship piping system string washing loop connection method according to an embodiment of the application is shown;

[0043] Figure 3 A distribution of string washing loop paths of different lengths obtained by multiple implementations of the ship piping system string washing loop connection method in an embodiment of the application is shown;

[0044] Figure 4A schematic diagram of the process for connecting the ship piping system series washing circuit according to Embodiment 2 of the present invention is shown;

[0045] Figure 5 The terminal of Embodiment 4 of the present invention is shown. Detailed Implementation

[0046] The embodiments of the present invention will be described in detail below with reference to the accompanying drawings and examples, so that the process of how the present invention uses technical means to solve technical problems and achieve technical effects can be fully understood and implemented accordingly. It should be noted that, as long as there is no conflict, the various embodiments and features in the various embodiments of the present invention can be combined with each other, and the resulting technical solutions are all within the protection scope of the present invention.

[0047] Existing ship piping system tandem washing connections often require manual design, meaning that professional staff need to design loop connections for numerous piping systems to be tandem washed. This connection design method is cumbersome, labor-intensive, and prone to design errors. In addition, this design approach has limited options and often fails to yield the longest tandem washing loop.

[0048] Example One

[0049] To address the technical problems existing in the prior art, embodiments of the present invention provide a method for connecting a series washing loop in a ship's piping system.

[0050] Figure 1 A schematic flowchart of the ship piping system series washing circuit connection method according to Embodiment 1 of the present invention is shown; Figure 2 This diagram illustrates the implementation process of the ship piping system series washing loop connection method according to Embodiment 1 of the present invention; see reference. Figure 1 and Figure 2 As shown, the method for connecting the series washing circuit of the ship piping system according to an embodiment of the present invention includes the following steps.

[0051] Step S101: Construct an undirected graph model based on all the piping systems to be washed in the ship system.

[0052] Specifically, the piping systems in a ship's system that require cascading cleaning are referred to as the cascading cleaning piping systems. An undirected graph model is constructed based on all the cascading cleaning piping systems in the ship's system. The ports of each pipe segment in the cascading cleaning piping system, pre-set flow-through devices, and multi-pipe convergence points are used as vertices in the undirected graph model. If vertices are connected by pipe segments in the actual piping system, a corresponding undirected edge exists in the undirected graph; the actual distance is not considered at this stage. Then, all vertices in the undirected graph model are grouped according to pre-set grouping conditions to provide a grouping basis for subsequent determination of vertices that can be crossed.

[0053] It should be noted that all piping systems to be queuing in a ship's system can be a portion or the entire system. Furthermore, ship systems typically involve complex piping systems.

[0054] Step S102: Randomly select a vertex from the undirected graph model as the starting vertex, and add the starting vertex as the current vertex to the searched path.

[0055] Specifically, a vertex is randomly selected from the undirected graph model as the starting vertex of the shuffling loop, and recorded in the searched path as the starting vertex of the searched path. Simultaneously, the starting vertex is used as the criterion for determining subsequent vertices in the searched path, i.e., the starting vertex is considered the current vertex. It should be noted that the searched path is mainly used to progressively record the vertices of the searched shuffling loop path, and the vertices are sequentially connected in the order they were found.

[0056] Step S103: Determine whether the current vertex has any connected vertices. If it does, then all connected vertices of the current vertex are taken as reserve vertices and all reserve vertices are set into a reserve vertex set. Otherwise, proceed to step S107.

[0057] Specifically, vertices directly connected to the current vertex via undirected edges are considered as connected vertices of the current vertex. It is then determined whether the current vertex has any connected vertices. If so, all connected vertices of the current vertex are searched, and all connected vertices are considered as candidate vertices for the searched paths. All candidate vertices are then set into a candidate vertex set. However, if the search reveals that no connected vertices of the current vertex exist in the undirected model, the process proceeds to step S107.

[0058] Step S104: Determine whether the set of prepared vertices contains the starting vertex. If it does, proceed to step S105; otherwise, proceed to step S106.

[0059] Specifically, this step is to determine whether the set of preliminary vertices obtained in step S103 or step S107 exists in the set of preliminary vertices. If it exists, proceed to step S105 to further determine the currently searched path. If the set of preliminary vertices does not contain a starting vertex, proceed to step S106 to search for the next vertex to be connected in the set of preliminary vertices.

[0060] Step S105: Determine whether the number of vertices in the currently searched path is greater than the preset number. If so, connect the starting vertex to the currently searched path to obtain a serial loop path and record it, then proceed to step S108. Otherwise, remove the starting vertex from the reserve vertex set.

[0061] Specifically, the number of vertices in the currently searched path is queried, and then it is determined whether the number of vertices in the currently searched path is greater than a preset number. That is, it is determined whether the number of vertices in the currently searched path can form a cycle, or whether the number of vertices in the currently searched path can form a cycle that meets the number of vertices required for a cycle. If the number of vertices in the currently searched path is greater than the preset number, it means that the number of vertices in the currently searched path can form a cycle or can form a cycle with a certain number of vertices. At this time, the starting vertex is connected to the currently searched path to form a shuffled cycle path, and the obtained shuffled cycle path is recorded. Then, the process proceeds directly to step S108 to end the connection of the shuffled cycle path. If the number of vertices in the currently searched path is not greater than the preset number, it means that the number of vertices in the currently searched path cannot form a cycle or cannot form a cycle with a certain number of vertices. At this time, the starting vertex is removed from the reserve vertex set, and then the remaining reserve vertices in the reserve vertex set are further configured. Preferably, to avoid the situation where the searched path cannot form a cycle, the number of vertices can be set to 2.

[0062] Step S106: Determine whether all the prepared vertices in the prepared vertex set are in the current searched path. If so, proceed to step S107. Otherwise, randomly select one prepared vertex from all the prepared vertices that are not in the searched path and connect it to the searched path. Then, take the selected prepared vertex as the new current vertex and proceed to step S103.

[0063] Specifically, the set of prepared vertices in this step is the set of prepared vertices after removing the set of starting vertices. Since the searched paths are continuously updated as connected vertices are found, the searched paths used in this step are also the current searched paths. That is, it is determined whether all prepared vertices in the current set are already in the current searched path. If so, proceed to step S107 to further determine the current vertex. If not all prepared vertices in the current set are in the current searched path, and some prepared vertices are not yet connected to the current searched path, then randomly select one prepared vertex from all those not in the current set and connect it to the searched path. This selected prepared vertex is then used as the new current vertex. Then, proceed to step S103 to re-query the next searched path connected vertex.

[0064] Step S107: Determine whether the current vertex has any vertices that can be crossed. If so, treat all vertices that can be crossed by the current vertex as reserve vertices and set all reserve vertices into a reserve vertex set. Then proceed to step S104. Otherwise, proceed to step S108.

[0065] Specifically, it is determined whether the current vertex has a bridging vertex. Further, the bridging vertex for the current vertex is determined by meeting the bridging condition. When searching for a bridging scheme for the cascading loop, the main constraint is the bridging principle between pipe segments, meaning that only vertices meeting certain bridging conditions can bridging the current vertex. These bridging conditions need to be determined based on the specific circumstances of the piping system. Further, the bridging conditions can be set as follows: the vertex belongs to the same group as the current vertex and is not considered a bridging vertex for other vertices; simultaneously, the straight-line distance to the current vertex must not exceed a preset distance. When it is determined that the current vertex has a bridging vertex, all bridging vertices of the current vertex are sequentially determined according to the bridging conditions, and all bridging vertices of the current vertex are considered as reserve vertices. Then, all reserve vertices are set into a reserve vertex set, and the process jumps to step S104. Based on the operation on the reserve vertex set in step S104, further queries are performed on the next connected vertex of the searched path. However, when it is determined that the current vertex does not have a bridging vertex, the process directly jumps to step S108.

[0066] Step S108: End the connection.

[0067] In order to better represent the searched series washing loop path and make the searched series washing loop path clearer, the ship piping system series washing loop connection method of the present invention may further include step S109, the specific content of step S109 is as follows.

[0068] Step S109: Represent the serial washing loop path in the form of an adjacency matrix.

[0069] Specifically, after the undirected graph has been bridging to form a certain loop, it can be represented by an adjacency matrix. The existing segments are the known adjacency information, recorded in the form of a matrix called _known_fl. The bridging part is determined by the grouping of vertices, and the corresponding elements on the main diagonal of the adjacency matrix are used to form an adjacency submatrix to represent the variable part of the bridging problem.

[0070] To better illustrate the connection method of the ship piping system series cleaning circuit in the embodiments of the present invention, the design of certain piping system cleaning series cleaning circuit paths of a certain ship is used as an example for illustration.

[0071] Assuming a ship's piping system to be flushed includes supply lines, oil transfer lines, refueling lines, oil drain lines, and return lines, all pipe segments within the system are abstracted into an undirected graph. All 42 vertices are named and grouped according to their respective compartments, as follows:

[0072] (1) Pump room 1—V081, V083~V088;

[0073] (2) Pump room 2—V089~V102;

[0074] (3) Day service cabins – V108~V115;

[0075] (4) Fuel tank No. 1 – V116 to V119;

[0076] (5) Fuel tank No. 2 – V120, V121;

[0077] (6) Fuel tank No. 3 – V122, V123;

[0078] (7) Fuel tank No. 4 - V124, V125;

[0079] (8) Fuel tank No. 5 - V126 to V128.

[0080] After the undirected graph is bridging and forms a certain loop, it can be represented by an adjacency matrix A. The existing pipe segments are the known adjacency information, which is recorded by matrix A_known_fl. The bridging part is determined by the grouping of vertices. The corresponding elements are found around the diagonal of the adjacency matrix A to form 8 adjacency submatrices A(1) to A(8) to represent the variable part of the bridging problem.

[0081] The conditions for allowing vertices to be traversed are as follows: the vertex must belong to the same group as the current vertex and not be used as a traversable vertex for other vertices; the straight-line distance between the vertex and the current vertex must not exceed a preset distance. The preset distance can be set to 20m. The number of vertices is set to 2.

[0082] Based on the above input information and constraints, execute steps S101-S109.

[0083] The statistical data of the number of serial washing loop paths of different lengths obtained after repeating the above steps 10001 times are shown in Table 1 below.

[0084] Table 1

[0085] Loop length 37 33 29 25 21 17 13 9 5 Number 119 159 171 193 143 113 56 24 1

[0086] As shown in the table above, this method can search for the length of the longest simple loop corresponding to different pipeline connection methods. The longest loop length is 37 (both the beginning and end are starting vertices, so it actually covers 36 out of 42 vertices), and there are multiple connection forms.

[0087] By setting different execution counts, the distribution of the ratio of different length loops obtained by this method to the total number of loops obtained in the search also shows... Figure 3As shown, it can be seen that as the number of searches increases, the distribution of the number of loops of different lengths found in the entire search process tends to stabilize. Therefore, from the perspective of engineering applications, the simple loop with a length of 37 obtained by this method can be considered as the optimal solution, and there are multiple choices for the specific bridging method between pipe segments.

[0088] The ship piping system series cleaning loop connection method provided in this invention abstracts the originally complex ship piping system into an undirected graph mathematical model. The adjacency relationship of each vertex in the undirected graph is determined by the existing pipe segments of the original piping system. Piping system designers only need to clarify the constraints of the system cleaning series cleaning bridging. Through multiple implementations of the method of this invention, a series of compliant bridging schemes can be quickly obtained, avoiding the need for manual searching of bridging schemes on complex piping schematic diagrams. Therefore, it greatly improves production efficiency and accuracy, and provides necessary technical support for shortening the cycle of system cleaning tests.

[0089] Example Two

[0090] To address the technical problems existing in the prior art, embodiments of the present invention provide a ship piping system series washing circuit connection device.

[0091] Figure 4 A schematic diagram of the flow chart of the ship piping system series washing circuit connection device according to Embodiment 2 of the present invention is shown; Reference Figure 4 As shown, the ship piping system series washing loop connection device of this invention includes an undirected graph generation module, a starting vertex setting module, an adjacent vertex determination module, a starting vertex determination module, a number of vertices of the searched path determination module, a searched path determination module, a crossable vertex determination module, and an algorithm termination module.

[0092] The undirected graph generation module is used to construct an undirected graph model based on all the piping systems to be flushed in the ship system;

[0093] The starting vertex setting module is used to randomly select a vertex from the undirected graph model as the starting vertex, set the starting vertex as the current vertex, and include it in the searched path;

[0094] The adjacent vertex determination module is used to determine whether the current vertex has any connected vertices. If they do, all connected vertices of the current vertex are taken as reserve vertices and all reserve vertices are set into a reserve vertex set. Otherwise, the current vertex is transmitted to the cross-vertex determination module.

[0095] The starting vertex determination module is used to determine whether the preparatory vertex set contains a starting vertex. If so, the preparatory vertex set is transmitted to the searched path vertex count determination module; otherwise, the preparatory vertex set is transmitted to the searched path determination module.

[0096] The vertex count determination module of the searched path is used to determine whether the number of vertices in the current searched path is greater than the preset number. If so, the starting vertex is connected to the current searched path to obtain the serial loop path and recorded, and then the connection is terminated. Otherwise, the starting vertex is removed from the reserve vertex set.

[0097] The searched path determination module is used to determine whether all the preparatory vertices in the preparatory vertex set are in the current searched path. If so, the current vertex is transmitted to the bridging vertex determination module. Otherwise, one preparatory vertex that is not in the searched path is randomly selected from all the preparatory vertices in the preparatory vertex set and connected to the searched path. The selected preparatory vertex is used as the new current vertex and transmitted to the adjacent vertex determination module.

[0098] The traversable vertex determination module is used to determine whether there are traversable vertices for the current vertex. If there are, all traversable vertices of the current vertex are taken as reserve vertices and all reserve vertices are set into a reserve vertex set. Then the reserve vertex set is transmitted to the starting vertex determination module; otherwise, the connection ends.

[0099] The connection termination module is used to terminate a connection.

[0100] The ship piping system series cleaning loop connection device provided in this invention abstracts the originally complex ship piping system into an undirected graph mathematical model. The adjacency relationship of each vertex in the undirected graph is determined by the existing pipe segments of the original piping system. The piping system designer only needs to clarify the constraints of the system cleaning series cleaning bridging. Through multiple implementations of the device of this invention, a series of compliant bridging schemes can be quickly obtained, avoiding the need for manual searching for bridging schemes on complex piping system schematic diagrams. Therefore, it greatly improves production efficiency and accuracy, and provides necessary technical support for shortening the cycle of system cleaning tests.

[0101] Example Three

[0102] To address the aforementioned technical problems in the prior art, this embodiment of the invention also provides a storage medium storing a computer program that, when executed by a processor, can implement all the steps in the ship piping series washing loop connection method of Embodiment 1.

[0103] The specific steps of the ship piping system series washing circuit connection method and the beneficial effects obtained by applying the readable storage medium provided in the embodiments of the present invention are the same as those in Embodiment 1, and will not be repeated here.

[0104] It should be noted that storage media include various media that can store program code, such as ROM, RAM, magnetic disks, or optical disks.

[0105] Example Four

[0106] To address the aforementioned technical problems in the prior art, this invention also provides a terminal.

[0107] Figure 5 A schematic diagram of the terminal structure of Embodiment 4 of the present invention is shown, with reference to... Figure 5 In this embodiment, the terminal includes a processor and a memory that are interconnected. The memory is used to store computer programs, and the processor is used to execute the computer programs stored in the memory, so that when the terminal is executed, it can implement all the steps of the ship piping series washing loop connection method of Embodiment 1.

[0108] The specific steps of the ship piping system series washing circuit connection method and the beneficial effects obtained by applying the terminal provided in this embodiment of the invention are the same as in Embodiment 1, and will not be repeated here.

[0109] It should be noted that the memory may include random access memory (RAM) and may also include non-volatile memory, such as at least one disk storage device. Similarly, the processor can be a general-purpose processor, including a central processing unit (CPU), a network processor (NP), etc.; it can also be a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components.

[0110] While the embodiments disclosed in this invention are as described above, the content is merely for the purpose of facilitating understanding of the invention and is not intended to limit the invention. Any person skilled in the art to which this invention pertains may make any modifications and changes in form and detail of the implementation without departing from the spirit and scope disclosed herein; however, the scope of protection of this invention shall still be determined by the scope defined in the appended claims.

Claims

1. A method for connecting a series flushing loop in a ship's piping system, comprising: Step 1: Construct an undirected graph model based on all the piping systems to be flushed in the ship's system; Step 2: Randomly select a vertex from the undirected graph model as the starting vertex, and add the starting vertex as the current vertex to the searched path; Step 3: Determine whether the current vertex has any connected vertices. If it does, then all connected vertices of the current vertex are taken as reserve vertices, and all the reserve vertices are set into a reserve vertex set. Otherwise, proceed to step 7. Step 4: Determine whether the set of prepared vertices contains the starting vertex. If it does, proceed to step 5; otherwise, proceed to step 6. Step 5: Determine whether the number of vertices in the currently searched path is greater than the preset number. If so, connect the starting vertex to the currently searched path to obtain a shuffling loop path and record it, and then execute Step 8. Otherwise, remove the starting vertex from the set of reserve vertices. Step 6: Determine whether all the prepared vertices in the prepared vertex set are in the current searched path. If so, proceed to Step 7; otherwise, randomly select one prepared vertex from all the prepared vertices in the prepared vertex set that are not in the searched path and connect it to the searched path. Then, use the selected prepared vertex as the new current vertex and proceed to Step 3. Step 7: Determine whether the current vertex has any vertices that can be crossed. If so, treat all vertices that can be crossed by the current vertex as reserve vertices and set all the reserve vertices into a reserve vertex set. Then execute Step 4. Otherwise, execute Step 8. In step seven, the method for determining the vertex that can be crossed by the current vertex is to meet the crossing condition; the crossing condition is: it belongs to the same group as the current vertex and is not considered as a vertex that can be crossed by other vertices. The straight-line distance from the current vertex does not exceed a preset distance; Step 8: End the connection; In the undirected graph model, the ports of each pipe segment in the pipeline system to be washed, the preset overcurrent devices, and the multi-pipe convergence point are used as vertices in the undirected graph model, the pipe segments connecting each vertex are used as undirected edges, and all the vertices are grouped based on preset grouping conditions.

2. The connection method according to claim 1, characterized in that, The method further includes: Step 9: Represent the shuffling loop path in the form of an adjacency matrix, wherein the adjacency subarray of the adjacency matrix is ​​composed of the vertices that can be crossed in the shuffling loop path, and the adjacency subarray is a submatrix on the main diagonal of the adjacency matrix.

3. The connection method according to claim 1, characterized in that, All piping systems to be connected for cleaning are either some or all of the piping systems in the aforementioned ship system.

4. The connection method according to claim 1, characterized in that, The connected vertices are those that are directly connected to the current vertex via undirected edges.

5. The connection method according to claim 1, characterized in that, The preset number is 2.

6. A connection device for a ship's piping system series washing circuit, characterized in that, It includes an undirected graph generation module, a starting vertex setting module, an adjacent vertex determination module, a starting vertex determination module, a number of vertices in the searched path determination module, a searched path determination module, a vertex that can be crossed determination module, and an algorithm termination module; The undirected graph generation module is used to construct an undirected graph model based on all the pipe systems to be connected and washed in the ship system; The starting vertex setting module is used to randomly select a vertex from the undirected graph model as the starting vertex, and to set the starting vertex as the current vertex and include it in the searched path; The adjacent vertex determination module is used to determine whether the current vertex has connected vertices. If it does, all connected vertices of the current vertex are taken as reserve vertices and all reserve vertices are set into a reserve vertex set. Otherwise, the current vertex is transmitted to the cross-connectable vertex determination module. The starting vertex determination module is used to determine whether the starting vertex is included in the preparatory vertex set. If so, the preparatory vertex set is transmitted to the number of vertices in the searched path determination module; otherwise, the preparatory vertex set is transmitted to the searched path determination module. The vertex count determination module of the searched path is used to determine whether the number of vertices in the current searched path is greater than a preset number. If so, the starting vertex is connected to the current searched path to obtain a serial loop path and recorded, and then the connection is terminated. Otherwise, the starting vertex is removed from the set of reserve vertices. The searched path determination module is used to determine whether all the preparatory vertices in the preparatory vertex set are in the current searched path. If so, the current vertex is transmitted to the bridging vertex determination module. Otherwise, one preparatory vertex in the preparatory vertex set that is not in the searched path is randomly selected and connected to the searched path. The selected preparatory vertex is used as the new current vertex and transmitted to the adjacent vertex determination module. The vertex traversability determination module is used to determine whether the current vertex has a traversable vertex. If it does, all traversable vertices of the current vertex are taken as reserve vertices and all reserve vertices are set into a reserve vertex set. Then, the reserve vertex set is transmitted to the starting vertex determination module. Otherwise, the connection ends. The current vertex is determined as a vertex that can be crossed by other vertices by meeting the crossing condition; the crossing condition is that it belongs to the same group as the current vertex and is not considered as a vertex that can be crossed by other vertices. The straight-line distance from the current vertex does not exceed a preset distance; The connection termination module is used to terminate the connection; In the undirected graph model, the ports of each pipe segment in the pipeline system to be washed, the preset overcurrent devices, and the multi-pipe convergence point are used as vertices in the undirected graph model, the pipe segments connecting each vertex are used as undirected edges, and all the vertices are grouped based on preset grouping conditions.

7. A storage medium having a computer program stored thereon, characterized in that, When the program is executed by the processor, it implements the ship piping series washing loop connection method as described in any one of claims 1 to 5.

8. A terminal, characterized in that, include: A processor and a memory, wherein the memory and the processor are communicatively connected; The memory is used to store a computer program, and the processor is used to execute the computer program stored in the memory to cause the terminal to perform the ship piping series washing loop connection method as described in any one of claims 1 to 5.

Images