Drainage pipe network node importance assessment method, device and equipment and storage medium

Abstract

The invention provides a drainage pipe network node importance evaluation method and device, equipment and a storage medium. The drainage pipe network node importance assessment method comprises the steps of obtaining a drainage pipe network diagram to be assessed; converting the drainage pipe network diagram into a directed network diagram; determining the degree and target weight of each node in the directed network graph; performing importance sorting on the target weights to obtain importance sorting results of the nodes corresponding to the target weights; marking key nodes in the directed network graph based on the degree of each node and the importance sorting result of the nodes corresponding to the target weight to obtain the directed network graph marked with the key nodes; the directed network graph marked with the key nodes is converted into the drainage pipe network graph marked with the key nodes, the key nodes of the drainage pipe network are efficiently and accurately obtained through a scientific method without depending on the working experience of pipe network workers, blindness of monitoring point distribution is avoided, and efficient management of the drainage pipe network can be achieved.

Description

Technical Field

[0001] This application belongs to the technical field of drainage network detection, and relates to a method for evaluating the importance of drainage network nodes, in particular to a method, device, equipment and storage medium for evaluating the importance of drainage network nodes. Background Art

[0002] As a key part of urban infrastructure, the drainage system undertakes the tasks of collecting and transporting rainwater and sewage. Facing the problems of drainage network complexity and aging brought about by urban expansion, as well as challenges such as siltation, blockage and sewage overflow resulting therefrom, higher requirements are put forward for the facility management, operation monitoring, emergency flood control and scientific decision-making capabilities of the drainage network. In some technical solutions, the drainage network diagram is converted into an undirected network graph, and the key nodes are screened by calculating the betweenness centrality and degree of the network nodes. However, this calculation method ignores the drainage flow direction information in the pipeline and is suitable for application when the network data is incomplete, and its application field is limited. Therefore, researching how to optimize the layout of monitoring points to comprehensively reflect the operation status of the drainage network with the least number of monitoring points has become a technical problem that urgently needs to be solved in the field of drainage system management. Summary of the Invention

[0003] This application provides a method, device, equipment and storage medium for evaluating the importance of drainage network nodes, which is used to optimize the layout of drainage system monitoring points in the field of drainage system management.

[0004] In a first aspect, an embodiment of this application provides a method for evaluating the importance of drainage network nodes, and the method includes:

[0005] Obtain a drainage network diagram to be evaluated; convert the drainage network diagram into a directed network graph; determine the degree of each node in the directed network graph; determine the target weight of each node in the directed network graph; perform importance ranking on the target weights to obtain the importance ranking result of the nodes corresponding to the target weights; based on the degree of each node and the importance ranking result of the nodes corresponding to the target weights, mark the key nodes in the directed network graph to obtain the directed network graph after marking the key nodes; convert the directed network graph after marking the key nodes into the drainage network diagram after marking the key nodes.

[0006] In an implementation of the first aspect, the conversion of the drainage pipe network diagram into a directed network diagram includes: converting the appurtenant structures of the drainage pipes in the drainage pipe network diagram into the nodes of the directed network diagram, where the appurtenant structures of the drainage pipes include at least one or more of inspection wells, stormwater inlets, pumping stations, drainage outlets, and sewage treatment plants; converting the pipelines with flow direction information in the drainage pipe network diagram into the directed edges of the directed network diagram; and obtaining the directed network diagram corresponding to the drainage pipe network diagram based on the nodes and the directed edges.

[0007] In an implementation of the first aspect, the expression for determining the degree of each node in the directed network diagram is:

[0008]

[0009] where k i represents the degree of node i, a i,j represents the edge pointing from node i to other nodes, a j,i represents the edge pointing from other nodes to node i, and a i,j is equal to 0 or 1, a j,i is equal to 0 or 1, and m represents the number of connection points around node i.

[0010] In an implementation of the first aspect, the determination of the target weight of each node in the directed network diagram includes: setting an initial weight for each node in the directed network diagram; constructing a transition matrix based on the out-degree of each node in the directed network diagram; and iteratively calculating the weights of each node in the directed network diagram using the transition matrix until the difference between the weights of each node in the directed network diagram in two consecutive iterations is within a preset threshold range, at which point the iteration stops, and the target weights of each node in the directed network diagram are obtained.

[0011] In an implementation of the first aspect, the expression for iteratively calculating the weights of each node in the directed network diagram using the transition matrix is:

[0012] PR new = p * P * PR old + (1 - p) * PR old

[0013] where PR new represents the weight after iterative calculation, PR old represents the weight before iterative calculation, p represents the damping factor, and P represents the transition matrix.

[0014] In one implementation manner of the first aspect, the importance ranking of the target weights to obtain the importance ranking result of the nodes corresponding to the target weights includes: sorting the target weights based on the descending order to obtain the importance ranking result of each node corresponding to the target weights.

[0015] In one implementation manner of the first aspect, the marking of the key nodes in the directed network graph based on the degrees of the respective nodes and the importance ranking result of the nodes corresponding to the target weights to obtain the directed network graph after marking the key nodes includes: determining the candidate nodes as the nodes in the directed network graph with the preset number of the top importance ranking results; among the candidate nodes, marking the candidate nodes corresponding to the degrees greater than the preset degree value as the key nodes to obtain the directed network graph after marking the key nodes.

[0016] In the drainage network node importance evaluation method provided in the embodiments of the present application, by obtaining the drainage network graph to be evaluated; converting the drainage network graph into a directed network graph; and determining the degrees and target weights of the respective nodes in the directed network graph, and performing importance ranking on the target weights to obtain the importance ranking result of the nodes corresponding to the target weights, marking the key nodes in the directed network graph based on the degrees of the respective nodes and the importance ranking result of the nodes corresponding to the target weights to obtain the directed network graph after marking the key nodes; converting the directed network graph after marking the key nodes into the drainage network graph after marking the key nodes, this drainage network node importance evaluation method can, without relying on the work experience of the network staff, obtain the importance ranking result of the nodes based on the degrees and target weights of the respective nodes in the directed network graph, and efficiently, reasonably, and accurately calculate the key nodes of the drainage network, avoid the blindness of monitoring point layout, improve the resource utilization efficiency, and achieve high-efficiency and high-level management of the drainage network.

[0017] In a second aspect, the embodiments of the present application provide a drainage network node importance evaluation device, and the drainage network node importance evaluation device includes:

[0018] A drainage pipe network diagram acquisition module for acquiring a drainage pipe network diagram to be evaluated; a first conversion module for converting the drainage pipe network diagram into a directed network diagram; a node degree determination module for determining the degree of each node in the directed network diagram; a target weight determination module for determining the target weight of each node in the directed network diagram; an importance ranking result determination module for performing an importance ranking on the target weights to obtain an importance ranking result of the nodes corresponding to the target weights; a key node annotation module for annotating key nodes in the directed network diagram based on the degree of each node and the importance ranking result of the nodes corresponding to the target weights to obtain the directed network diagram with key nodes annotated; a second conversion module for converting the directed network diagram with key nodes annotated into the drainage pipe network diagram with key nodes annotated.

[0019] In a third aspect, an embodiment of the present application provides a computer-readable storage medium, on which a computer program is stored, characterized in that when the computer program is executed by a processor, it implements the drainage pipe network node importance evaluation method according to any one of the first aspects of the embodiments of the present application.

[0020] In a fourth aspect, an embodiment of the present application provides an electronic device, the electronic device includes a memory and a processor; the memory is used for storing a computer program; the processor is used for executing the computer program and when executing the computer program, implements the drainage pipe network node importance evaluation method according to any one of the first aspects of the embodiments of the present application. Description of the Drawings

[0021] Figure 1 It shows a flowchart of the drainage pipe network node importance evaluation method provided by an embodiment of the present application.

[0022] Figure 2 It shows a directed network diagram provided by an embodiment of the present application.

[0023] Figure 3 It shows a flowchart of converting the drainage pipe network diagram into a directed network diagram provided by an embodiment of the present application.

[0024] Figure 4 It shows a flowchart of determining the target weight of each node in the directed network diagram provided by an embodiment of the present application.

[0025] Figure 5 It shows a flowchart of determining the directed network diagram with key nodes annotated provided by an embodiment of the present application.

[0026] Figure 6 It shows a schematic diagram of another directed network diagram provided by an embodiment of the present application.

[0027] Figure 7 It shows a schematic diagram of a device for evaluating the importance of drainage network nodes provided by an embodiment of the present application.

[0028] Figure 8 It shows a schematic structural diagram of an electronic device provided by an embodiment of the present application.

[0029] Element reference numeral description

[0030] Steps S11 - S17

[0031] Steps S31 - S33

[0032] Steps S41 - S43

[0033] Steps S51 - S52

[0034] 70 Device for evaluating the importance of drainage network nodes

[0036] 71 Drainage network map acquisition module

[0037] 72 First conversion module

[0038] 73 Node degree determination module

[0039] 74 Target weight determination module

[0040] 75 Importance ranking result determination module

[0041] 76 Key node annotation module

[0042] 77 Second conversion module

[0043] 80 Electronic device

[0044] 81 Processor

[0045] 82 Non - volatile storage medium

[0046] 83 System bus

[0047] 84 Internal memory

[0048] 85 Network interface Detailed implementation manners

[0049] The following uses specific specific examples to illustrate the implementation manners of the present application. Those skilled in the art can easily understand other advantages and effects of the present application from the content disclosed in this specification. The present application can also be implemented or applied through other different specific implementation manners, and various details in this specification can also be modified or changed based on different viewpoints and applications without departing from the spirit of the present application. It should be noted that, without conflict, the following embodiments and the features in the embodiments can be combined with each other.

[0050] It should be noted that the diagrams provided in the following embodiments only illustrate the basic concept of the present application in a schematic manner. Therefore, only the components related to the present application are shown in the diagrams, rather than being drawn according to the number, shape, and size of the components in actual implementation. The form, quantity, and proportion of each component in actual implementation can be arbitrarily changed, and the component layout form may also be more complex.

[0051] In the process of evaluating the importance of drainage network nodes in the prior art, there is a lack of an accurate and efficient method for evaluating the importance of drainage network nodes.

[0052] At least for the above problems, the embodiments of the present application provide a method for evaluating the importance of drainage network nodes. The method for evaluating the importance of drainage network nodes can obtain a drainage network diagram to be evaluated; convert the drainage network diagram into a directed network diagram; determine the degree of each node in the directed network diagram; determine the target weight of each node in the directed network diagram; perform importance ranking on the target weights to obtain the importance ranking result of the nodes corresponding to the target weights; based on the degree of each node and the importance ranking result of the nodes corresponding to the target weights, mark the key nodes in the directed network diagram to obtain the directed network diagram after marking the key nodes; convert the directed network diagram after marking the key nodes into the drainage network diagram after marking the key nodes, which can solve the technical problem of the lack of an accurate and efficient method for evaluating the importance of drainage network nodes in the prior art.

[0053] Figure 1 It shows a flowchart of the method for evaluating the importance of drainage network nodes provided by an embodiment of the present application. As Figure 1 shown, the method for evaluating the importance of drainage network nodes provided by the embodiments of the present application includes the following steps S11 to S17.

[0054] S11, obtain a drainage network diagram to be evaluated.

[0055] Exemplarily, the drainage network diagram to be evaluated can be obtained through official channels, geographic information systems, drones, and comprehensive geophysical prospecting, etc. Among them, official channels include: urban water departments, housing and urban-rural development bureaus, planning bureaus, or construction bureaus, etc.; the geographic information system can specifically be a Geographic Information System (GIS) platform.

[0056] It should be noted that the above-listed ways of obtaining the drainage network diagram to be evaluated are only used for illustrative purposes. In actual applications, other appropriate ways of obtaining the drainage network diagram to be evaluated can also be selected according to specific application requirements, and the present application does not limit this.

[0057] S12. Convert the drainage pipe network diagram into a directed network diagram.

[0058] Among them, the directed network diagram is a network topology diagram, specifically reflecting the relative positions, connection relationships, and water flow directions of various structures in the drainage pipe network diagram.

[0059] Exemplarily, as Figure 2 shown, in this embodiment, the converted directed network diagram includes 35 nodes and 34 directed edges. Among them, the numbers are the numbers of each structure, and the node P represents the terminal pumping station or sewage treatment plant.

[0060] S13. Determine the degrees of each node in the directed network diagram.

[0061] Among them, the degrees of each node in the directed network diagram include the sum of the numbers of the out-degree and the in-degree.

[0062] In some embodiments, the expression corresponding to determining the degrees of each node in the directed network diagram is:

[0063]

[0064] Among them, k i represents the degree of node i, a i,j represents the edge pointing from node i to other nodes, a j,i represents the edge pointing from other nodes to node i, and a i,j is equal to 0 or 1, a j,i is equal to 0 or 1, and m represents the number of connection points around node i.

[0065] Specifically, the in-degree of a node refers to the number of drainage branch pipes flowing into the node. The larger the in-degree of the node, the more water collection paths the node has, the greater the possibility of changes in the drainage situation of the node, and the greater the control difficulty. The out-degree of a node refers to the number of drainage pipes flowing from the node. The larger the out-degree of the node, the wider the influence range of the node on the downstream drainage pipe network. That is, the larger the degree of the node, the more likely the node is to become a key node in the drainage pipe network.

[0066] S14. Determine the target weights of each node in the directed network diagram.

[0067] Exemplarily, the target weights of each node in the directed network diagram can be determined based on the PageRank algorithm.

[0068] It should be noted that the method of obtaining the target weights of each node in the directed network diagram based on the PageRank algorithm above is only for illustrative purposes. In actual applications, the target weights of each node in the directed network diagram can also be obtained based on any other suitable method, and this application does not limit this.

[0069] S15. Perform an importance ranking on the target weights to obtain the importance ranking result of the nodes corresponding to the target weights.

[0070] In some embodiments, the performing an importance ranking on the target weights to obtain the importance ranking result of the nodes corresponding to the target weights includes: sorting the target weights based on the descending order to obtain the importance ranking result of each node corresponding to the target weights.

[0071] Exemplarily, based on the importance ranking result of the nodes obtained in the descending order, the node with the highest importance is arranged at the frontmost, and successively backward, the importance degree of the nodes becomes lower and lower.

[0072] S16. Based on the degrees of the respective nodes and the importance ranking result of the nodes corresponding to the target weights, mark the key nodes in the directed network graph to obtain the directed network graph after marking the key nodes.

[0073] Exemplarily, the key nodes can be marked with special labels, where the special labels can be pentagrams or triangles, etc.

[0074] S17. Convert the directed network graph after marking the key nodes into the drainage network graph after marking the key nodes.

[0075] Among them, compared with the drainage network graph to be evaluated, the drainage network graph after marking the key nodes adds the marked key nodes.

[0076] Specifically, the conversion of the directed network graph after marking the key nodes into the drainage network graph after marking the key nodes in this step is the reverse process of step S12.

[0077] In the drainage network node importance evaluation method provided in the embodiments of the present application, by obtaining the drainage network graph to be evaluated, converting the drainage network graph into a directed network graph, it clearly shows the positions and connection relationships of each structure in the drainage network graph, facilitating overall analysis and rapid evaluation of the key nodes in the drainage network graph; and by determining the degrees and target weights of each node in the directed network graph, obtaining the importance ranking result of the nodes corresponding to the target weights, and marking the key nodes in the directed network graph according to the importance ranking result to obtain the directed network graph after marking the key nodes, it does not rely on the work experience of the network staff, efficiently and accurately obtains the key nodes of the drainage network through a scientific method, avoids the blindness of monitoring point layout, and can realize the efficient management of the drainage network.

[0078] Figure 3Shown is a flowchart for converting the drainage pipe network diagram into a directed network diagram provided by an embodiment of the present application. As Figure 3 shown, the process of converting the drainage pipe network diagram into a directed network diagram in the embodiment of the present application includes the following steps S31 to S33.

[0079] S31, convert the appurtenant structures of the drainage pipes in the drainage pipe network diagram into the nodes of the directed network diagram.

[0080] Among them, the appurtenant structures of the drainage pipes include at least one or more of inspection wells, stormwater inlets, pumping stations, drainage outlets, sewage treatment plants.

[0081] S32, convert the pipelines with flow direction information in the drainage pipe network diagram into directed edges of the directed network diagram.

[0082] Specifically, for each pipeline in the drainage pipe network, according to its flow direction information, it is converted into a directed edge in the directed network diagram, and the direction of the directed edge should be consistent with the water flow direction in the pipeline.

[0083] S33, based on the nodes and the directed edges, obtain the directed network diagram corresponding to the drainage pipe network diagram.

[0084] Exemplarily, tools such as GIS, network analysis software (such as Pajek, Gephi) or programming languages (such as the NetworkX library of Python) can be used to obtain the directed network diagram corresponding to the drainage pipe network diagram.

[0085] It should be noted that the above-listed tools for obtaining the directed network diagram corresponding to the drainage pipe network diagram are only for illustrative purposes. In actual applications, other any suitable tools can also be selected according to specific application scenarios, and the present application does not limit this.

[0086] The embodiment of the present application provides a method for converting the drainage pipe network diagram into a directed network diagram. In this method, by converting the appurtenant structures of the drainage pipes in the drainage pipe network diagram into the nodes of the directed network diagram, and converting the pipelines with flow direction information in the drainage pipe network diagram into the directed edges of the directed network diagram; based on the nodes and the directed edges, obtain the directed network diagram corresponding to the drainage pipe network diagram. The directed network diagram can intuitively display the relative position relationship and connection relationship of each structure in the drainage pipe network diagram, providing a clear image example for subsequent determination of key nodes in the drainage pipe network. In addition, the directed network diagram helps relevant staff better understand the structure and function of the drainage pipe network system. In case of a failure or emergency, the directed network diagram can quickly locate the problem area, help formulate effective emergency response measures, reduce operating costs, and improve management efficiency.

[0087] Figure 4 Shown is a flowchart for determining the target weights of each node in the directed network diagram provided by an embodiment of the present application. As Figure 4 shown, the process of determining the target weights of each node in the directed network diagram in the embodiment of the present application includes the following steps S41 to S43.

[0088] S41, set initial weights for each node in the directed network diagram.

[0089] Exemplarily, there are three ways to determine the initial weights of each node in the directed network diagram as follows:

[0090] 1) Uniformly distribute the initial values, and all the initial values are set to 1 / N. For example, if the number of nodes in the directed network diagram is 35, then the initial weights of the network nodes are initialized to 1 / 35.

[0091] 2) Initial values based on the characteristics of the structures: For key drainage pipe structures such as pump stations, drainage outlets, and sewage treatment plants, higher initial values are given, while for inspection wells, rainwater inlets, etc., lower initial values are given. The advantage of this method is that it can utilize existing knowledge or information to guide the algorithm to converge to a result that is more in line with the actual situation faster.

[0092] 3) Randomly assign an initial value, usually within the interval (0, 1]. For example, use a random number generator to generate a random number between (0, 1] for each node as the initial PR value. The advantage of this method is that it can introduce a certain degree of randomness to avoid the algorithm falling into a local optimal solution. In some complex network structures, random initial values may enable the algorithm to explore more different paths and possibilities, thereby possibly discovering some hidden important nodes or relationships.

[0093] It should be noted that the three methods listed above for determining the initial weights of each node in the directed network diagram are only for illustrative purposes. In actual applications. The initial weights of each node in the directed network diagram can also be obtained through any other suitable method, and the present application does not limit this.

[0094] S42, construct a transition matrix based on the out-degrees of each node in the directed network diagram.

[0095] Exemplarily, a transition matrix P can be constructed based on the out-degrees of each node in the directed network diagram, where P[i][j] represents the transition probability from node i to node j. Among them, the calculation formula corresponding to the transition probability from node i to node j is: P[i][j] = 1 / out_degree(i), where out_degree(i) represents the out-degree of node i.

[0096] S43. Iteratively calculate the weights of each node in the directed network graph using the transfer matrix until the difference between two consecutive iterations of each node in the directed network graph is within a preset threshold range, and then stop the iteration to obtain the target weights of each node in the directed network graph.

[0097] Specifically, the expression corresponding to iteratively calculating the weights of each node in the directed network graph using the transfer matrix is:

[0098] PR new = p * P * PR old + (1 - p) * PR old

[0099] where PR new represents the weight after iterative calculation, PR old represents the weight before iterative calculation, p represents the damping factor, and P represents the transfer matrix.

[0100] Specifically, p can be set to 0.85.

[0101] It should be noted that the specific value of the above preset threshold range can be reasonably determined according to the specific application scenario, and this application does not limit it.

[0102] The embodiment of this application provides a method for determining the target weights of each node in the directed network graph. In this method, by setting initial weights for each node in the directed network graph, a transfer matrix is constructed based on the out-degree of each node in the directed network graph; and the weights of each node in the directed network graph are iteratively calculated using the transfer matrix until the difference between two consecutive iterations of each node in the directed network graph is within a preset threshold range, and then stop the iteration to obtain the target weights of each node in the directed network graph. By iteratively calculating the weights of each node, the relative importance of each node can be gradually adjusted to make the weight distribution more accurate.

[0103] Figure 5 Shown is a flowchart of determining the directed network graph after marking key nodes provided by an embodiment of this application. As Figure 5 shown, the process of determining the directed network graph after marking key nodes in the embodiment of this application includes the following steps S51 to S52.

[0104] S51. Determine the candidate nodes as the preset number of nodes in the directed network graph with the top-ranked importance sorting results.

[0105] It should be noted that the above preset number can be reasonably determined according to the specific application scenario, and this application does not limit it.

[0106] S52. Among the candidate nodes, label the candidate nodes corresponding to degrees greater than a preset degree value as key nodes, obtaining the directed network graph after labeling the key nodes.

[0107] It should be noted that the specific value of the preset degree value can be reasonably determined according to the specific application scenario, and this application does not limit it.

[0108] The embodiment of the present application provides a method for determining a directed network graph after labeling key nodes. In this method, by combining the degree of nodes and the target weight, through a scientific analysis method, the key nodes in the directed network graph can be more accurately identified, avoiding the determination of key nodes in the directed network graph through empirical values in the past, and improving the accuracy when determining key nodes.

[0109] The present application also provides an embodiment to determine the weight of the nodes of the directed network graph and the degree of the nodes in the directed network graph based on Figure 2 the directed network graph therein.

[0110] Specifically, the sorting of the weights of the nodes of the directed network graph from large to small is shown in Table 1.

[0111] Table 1 Sorting table of the weights of the nodes of the directed network graph

[0112]

[0113]

[0114] Among them, the "V" row represents the nodes, and the "PR" row represents the calculated weight values of the nodes.

[0115] Furthermore, to evaluate the importance of nodes, in addition to sorting the PR values and selecting the nodes with larger PR values in the sorting, the degree of nodes also needs to be considered. The calculation results of the degrees of the nodes of the directed network graph are shown in Table 2.

[0116] Table 2 Degrees of the directed network nodes

[0117] V 26 27 28 29 P 9 4 5 7 8 12 14 6 15 13 10 11 1 D 4 2 2 2 1 3 3 2 2 3 3 2 3 3 3 2 3 2 V 3 19 22 23 24 33 2 16 17 18 20 21 25 30 31 32 34 D 2 2 2 2 2 2 1 1 1 1 1 1 1 1 1 1 1

[0118] Among them, the "V" row represents the nodes, and the "D" row represents the calculated degrees of the nodes.

[0119] In actual pipeline network tracing, the assumption of water quality balance or flow balance needs to be followed, and process nodes often need to be ignored in the first round of tracing screening. Exemplarily, process nodes, starting points, and ending points with high weight values are excluded according to the requirement that the degree of nodes is greater than 2.

[0120] In this embodiment, the calculation result of the average weight value is retained to 4 decimal places as 0.0286.

[0121] Exemplarily, key nodes are calculated with a weight value greater than the average weight value of the directed network graph and a node degree greater than 2. The specific positions of the key nodes in the directed network graph are as Figure 6 shown.

[0122] The protection scope of the method for evaluating the importance of drainage network nodes in the embodiments of the present application is not limited to the execution order of the steps listed in this embodiment. Any solution achieved by adding or reducing steps of the prior art and replacing steps according to the principle of the present application is included in the protection scope of the present application.

[0123] The embodiments of the present application further provide a device for evaluating the importance of drainage network nodes. The device for evaluating the importance of drainage network nodes can implement the method for evaluating the importance of drainage network nodes in the present application. However, the implementation devices of the method for evaluating the importance of drainage network nodes in the present application include, but are not limited to, the structure of the device for evaluating the importance of drainage network nodes listed in this embodiment. Any structural deformation and replacement of the prior art made according to the principle of the present application are included in the protection scope of the present application.

[0124] As Figure 7 shown, in one embodiment, the device 70 for evaluating the importance of drainage network nodes of the present application includes a drainage network graph acquisition module 71, a first conversion module 72, a node degree determination module 73, a target weight determination module 74, an importance ranking result determination module 75, a key node annotation module 76, and a second conversion module 77.

[0125] The drainage network graph acquisition module 71 is configured to acquire a drainage network graph to be evaluated.

[0126] The first conversion module 72 is configured to convert the drainage network graph into a directed network graph.

[0127] The node degree determination module 73 is configured to determine the degree of each node in the directed network graph.

[0128] The target weight determination module 74 is configured to determine the target weight of each node in the directed network graph.

[0129] The importance ranking result determination module 75 is configured to rank the importance of the target weights to obtain an importance ranking result of the nodes corresponding to the target weights.

[0130] The key node annotation module 76 is configured to annotate key nodes in the directed network graph based on the degree of each node and the importance ranking result of the nodes corresponding to the target weights, so as to obtain the directed network graph after annotating the key nodes.

[0131] The second conversion module 77 is configured to convert the directed network graph after annotating the key nodes into the drainage network graph after annotating the key nodes.

[0132] Among them, the structure and principle of the drainage pipe network diagram acquisition module 71, the first conversion module 72, the node degree determination module 73, the target weight determination module 74, the importance ranking result determination module 75, the key node annotation module 76, and the second conversion module 77 correspond one by one to the steps in the above drainage pipe network node importance evaluation method, so they will not be elaborated here.

[0133] In several embodiments provided in the present application, it should be understood that the disclosed device or method can be implemented in other ways. For example, the device embodiments described above are merely illustrative. For example, the division of modules / units is only a logical function division. In actual implementation, there may be other division methods. For example, multiple modules or units can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the displayed or discussed mutual coupling or direct coupling or communication connection can be through some interfaces. The indirect coupling or communication connection of devices or modules or units can be in electrical, mechanical or other forms.

[0134] The modules / units described as separate components may or may not be physically separated. The components shown as modules / units may or may not be physical modules, that is, they can be located in one place or distributed to multiple network units. Some or all of the modules / units can be selected according to actual needs to achieve the purpose of the embodiments of the present application. For example, in each embodiment of the present application, the various functional modules / units can be integrated in a processing module, or each module / unit can exist physically alone, or two or more modules / units can be integrated in one module / unit.

[0135] Those of ordinary skill in the art should also be able to further realize that the units and steps of each example described in combination with the embodiments disclosed in this article can be implemented by a combination of electronic hardware, computer software, or both. To clearly illustrate the interchangeability of hardware and software, the components and steps of each example have been generally described according to their functions in the above description. Whether these functions are executed in a hardware or software manner depends on the specific application and design constraints of the technical solution. Professional technicians can use different methods to implement the described functions for each specific application, but such implementation should not be considered to exceed the scope of the present application.

[0136] The embodiments of the present application also provide a computer-readable storage medium. Those of ordinary skill in the art can understand that all or part of the steps in the methods of the above embodiments can be completed by instructing a processor through a program. The program can be stored in a computer-readable storage medium. The storage medium is a non-transitory medium, such as random access memory, read-only memory, flash memory, hard disk, solid-state drive, magnetic tape, floppy disk, optical disc, and any combination thereof. The above storage medium can be any available medium that can be accessed by a computer or a data storage device such as a server or a data center that integrates one or more available media. The available medium can be a magnetic medium (e.g., floppy disk, hard disk, magnetic tape), an optical medium (e.g., digital video disc (DVD)), or a semiconductor medium (e.g., solid state disk (SSD)), etc.

[0137] The embodiments of the present application also provide an electronic device. Figure 8 Shown is a schematic structural diagram of the electronic device 80 in an embodiment of the present application. The method for evaluating the importance of drainage network nodes provided by the embodiments of the present application can be applied to Figure 8 the electronic device 80 shown, but not limited thereto. As Figure 8 shown, the electronic device 80 includes a processor 81, a memory, a system bus 83, and a network interface 85. Among them, the memory may include a non-volatile storage medium 82 and an internal memory 84.

[0138] The non-volatile storage medium 82 can store an operating system and a computer program. The computer program includes program instructions. When the program instructions are executed, the processor can be made to execute any one of the methods for evaluating the importance of drainage network nodes provided by the embodiments of the present application.

[0139] The processor is used to provide computing and control capabilities to support the operation of the entire computer device.

[0140] The internal memory 84 provides an environment for the operation of the computer program in the non-volatile storage medium. When the computer program is executed by the processor, the processor can be made to execute any one of the methods for evaluating the importance of drainage network nodes provided by the embodiments of the present application.

[0141] The network interface 85 is used for network communication, such as sending assigned tasks, etc. Those skilled in the art can understand that Figure 8The structure shown is only a block diagram of some structures related to the solution of this application, and does not constitute a limitation on the computer device to which the solution of this application is applied. The specific computer device may include more or fewer components than those shown in the figure, or combine some components, or have a different component layout.

[0142] It should be understood that the processor 81 may be a central processing unit (CPU), and this processor may also be other general-purpose processors, digital signal processors (DSPs), application specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. Among them, the general-purpose processor may be a microprocessor or this processor may also be any conventional processor, etc.

[0143] The electronic device 80 in the embodiments of this application may include terminal devices such as tablet computers, laptop computers, mobile phones, supercomputers, smart wearable devices, etc., and may also be applied to databases, servers, and service response systems based on terminal artificial intelligence. The embodiments of this application do not impose any restrictions on the specific type of the electronic device.

[0144] For example, the electronic device may be a station (STAION, ST) in a WLAN, may be a cellular phone, cordless phone, session initiation protocol (SIP) phone, wireless local loop (WLL) station, a handheld device with wireless communication function, a computing device or other processing devices connected to a wireless modem, a computer, a laptop computer, a handheld communication device, a handheld computing device, and / or other devices for communicating on a wireless system, as well as next-generation communication systems, for example, a mobile terminal in a 5G network, a mobile terminal in a future evolved public land mobile network (PLMN), or a mobile terminal in a future evolved non-terrestrial network (NTN), etc.

[0145] By way of example and not limitation, when the electronic device is a wearable device, the wearable device can also be a general term for devices developed by applying wearable technology to the intelligent design of daily wear, such as gloves, watches, etc. equipped with a near field communication module. A wearable device is a portable device that is directly worn on the body or integrated into the user's clothes or accessories. By attaching to the user and using a pre-bound electronic card, operations such as payment and authentication can be performed. A wearable device is not just a hardware device, but also realizes powerful functions through software support, data interaction, and cloud interaction. Broadly speaking, wearable intelligent devices include those with complete functions and large sizes that can achieve complete or partial functions without relying on a smart phone, such as smart watches or smart glasses, as well as those that only focus on a certain type of application function and need to cooperate with other devices such as smart phones, such as various smart watches and smart bracelets with displays.

[0146] The descriptions of the processes or structures corresponding to the above respective drawings each have their own focuses. For parts not detailed in a certain process or structure, reference can be made to the relevant descriptions of other processes or structures.

[0147] The above embodiments are only illustrative of the principles and effects of the present application and are not intended to limit the present application. Any person familiar with this technology can modify or change the above embodiments without departing from the spirit and scope of the present application. Therefore, all equivalent modifications or changes made by those with ordinary knowledge in the technical field without departing from the spirit and technical idea disclosed in the present application should still be covered by the claims of the present application.

Claims

1. A method for evaluating the importance of drainage network nodes, characterized in that, The method comprises: Obtain a map of the drainage network to be assessed; Converting the drainage pipe network diagram into a directed network diagram; Determining the degree of each node in the directed network graph; Determining a target weight for each node in the directed network graph; Sorting the importance of the target weights to obtain importance ranking results of the nodes corresponding to the target weights; Based on the degree of each node and the importance ranking result of the node corresponding to the target weight, marking key nodes in the directed network graph to obtain the directed network graph with the key nodes marked; The directed network diagram with key nodes marked is converted into the drainage pipe network diagram with key nodes marked.

2. The drainage network node importance evaluation method according to claim 1, wherein: The converting the drainage pipe network diagram into a directed network diagram includes: Converting the drainage pipe ancillary structures in the drainage pipe network diagram into the nodes of the directed network diagram, wherein the drainage pipe ancillary structures include at least one or more of an inspection well, a rainwater inlet, a pumping station, a drainage outlet, and a sewage treatment plant; Converting pipelines with flow direction information in the drainage pipe network diagram into directed edges of the directed network diagram; Based on the nodes and the directed edges, the directed network graph corresponding to the drainage pipe network graph is obtained.

3. The method for evaluating the importance of drainage network nodes according to claim 1, characterized in that: The expression corresponding to the degree of each node in the directed network graph is: Among them, k i represents the degree of node i, a i,j represents the edge pointing from node i to other nodes, a j,i represents the edge pointing from other nodes to node i, and a i,j is equal to 0 or 1, a j,i is equal to 0 or 1, and m represents the number of connection points around node i.

4. The drainage network node importance evaluation method according to claim 1, characterized in that: Determining the target weight of each node in the directed network graph includes: Setting initial weights for each node in the directed network graph; Constructing a transfer matrix based on the out-degree of each node in the directed network graph; The transfer matrix is used to iteratively calculate the weight of each node in the directed network graph until the difference between the two iterations of each node in the directed network graph is within a preset threshold range, and the iteration is stopped to obtain the target weight of each node in the directed network graph.

5. The method for evaluating the importance of drainage network nodes according to claim 4, characterized in that: The expression corresponding to the iterative calculation of the weights of each node in the directed network graph using the transfer matrix is: PR new = p * P * PR old + (1 - p) * PR old Among them, PR new represents the weight after iterative calculation, and PR old represents the weight before iterative calculation. p represents the damping factor, and P represents the transition matrix.

6. The method for evaluating the importance of drainage network nodes according to claim 1, characterized in that: Sorting the target weights by importance to obtain importance ranking results of nodes corresponding to the target weights includes: The target weights are sorted based on an arrangement order from high to low to obtain the importance sorting result of each node corresponding to the target weight.

7. The method for evaluating the importance of drainage network nodes according to claim 6, characterized in that: The step of marking key nodes in the directed network graph based on the degree of each node and the importance ranking result of the nodes corresponding to the target weight, and obtaining the directed network graph after marking the key nodes, includes: Determine a preset number of nodes in the directed network graph that have higher importance ranking results as candidate nodes; Among the candidate nodes, the candidate nodes corresponding to the degrees greater than a preset degree value are marked as key nodes, and the directed network graph after the key nodes are marked is obtained.

8. An importance evaluation device for drainage pipe network nodes, characterized in that, The device comprises: A drainage network map acquisition module is used to obtain the drainage network map to be evaluated; A first conversion module, configured to convert the drainage pipe network diagram into a directed network diagram; A node degree determination module, configured to determine the degree of each node in the directed network graph; A target weight determination module, configured to determine the target weight of each node in the directed network graph; An importance ranking result determination module, configured to perform importance ranking on the target weights to obtain an importance ranking result of the nodes corresponding to the target weights; A key node annotation module, configured to annotate key nodes in the directed network graph based on the degrees of the respective nodes and the importance ranking result of the nodes corresponding to the target weights, to obtain the directed network graph after key node annotation; A second conversion module, configured to convert the directed network graph after key node annotation into the drainage pipe network graph after key node annotation.

9. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by a processor, it implements the drainage pipe network node importance evaluation method according to any one of claims 1 to 7.

10. An electronic device, characterized in that, The electronic device includes: A memory storing a computer program; A processor communicatively connected to the memory, and when calling the computer program, executes the drainage pipe network node importance evaluation method according to any one of claims 1 to 7.

Images