A method and system for topology analysis of power distribution networks

Abstract

This invention relates to a method and system for topology analysis of power distribution networks. The method constructs an undirected graph, subgraphs, and connected subgraphs by parsing metadata from SVG files of power distribution lines. Starting from a specified root node, a breadth-first search algorithm is used to traverse the subgraphs, marking the level of each node based on the distance from the root node to the current node. Edge pruning is performed based on the marked levels, and the undirected graph is converted into a directed graph according to the hierarchical relationships. Based on this, transformer-switch relationship analysis is performed to form a basic information table of the switches to which the transformer belongs, and tie line analysis is performed to obtain simplified tie paths. This invention ensures that the subgraph conforms to the radial structure of the power distribution network through hierarchical pruning, removes connections at the same level to prevent the formation of loop structures, and forms detailed and simplified tie paths, facilitating quick viewing of tie points between lines.

Description

Technical Field

[0001] This invention relates to a method and system for topology analysis of power distribution networks, belonging to the field of power transmission and distribution technology. Background Technology

[0002] In the process of intelligent development of distribution networks, single-line diagrams, as the core foundational information describing the physical connections of the power grid, have become increasingly mature and complete in their construction and application. Single-line diagrams provide intuitive and structured data support for all aspects of distribution network planning, operation, maintenance, and dispatching, effectively promoting the advancement of distribution networks towards lean, visualized, and digital management. They play an irreplaceable role in fault location, load transfer, network reconfiguration, and grid rationality analysis.

[0003] However, current mainstream topology analysis methods based on single-line diagrams still have significant shortcomings in depth and breadth. These methods often focus on basic path searching (such as connectivity from power source to load) or simple topology structure identification (such as radial or ring structures), but lack systematic mining and quantitative analysis of deeper topological characteristics of the network. This is mainly reflected in the following three aspects: First, the depth of connectivity analysis is insufficient. Existing analyses determine whether two points are connected (yes / no), but lack analysis of connectivity strength, redundancy, and critical channels. Second, the analysis of the impact range of nodes / branches is weak. Existing analyses of the impact range of single component (switch, line, transformer) failures or operations are often limited to directly connected adjacent devices or rely on manual experience, lacking the necessary automated analysis capabilities. Third, based on the topological location and electrical characteristics of equipment, it is difficult to identify the critical hub nodes that have the greatest impact on the connectivity, stability, and power supply reliability of the entire network.

[0004] Existing single-line diagrams of distribution networks lay the foundation for lean management, but their rich topological value has not yet been fully explored. There is an urgent need to develop more advanced topology analysis algorithms and tools that go beyond basic connectivity assessments to deeply analyze network connectivity redundancy, dynamic subgraph partitioning capabilities, and the cascading impact of node / branch operations. These in-depth topology characteristic analyses are indispensable core capabilities for building highly resilient, self-healing, and flexible smart distribution networks, which will greatly improve the distribution network's ability to cope with complex faults, adapt to high-proportion renewable energy integration, and achieve refined management and optimization. Summary of the Invention

[0005] This invention aims to provide a method and system for topology analysis of power distribution networks. It automatically analyzes the topology of power distribution networks based on metadata and graph theory modeling using SVG files, solving the problems of low efficiency and error-proneness in traditional manual analysis, and realizing structured output and in-depth analysis of the topology graph.

[0006] In a first aspect, this invention provides a method for topology analysis of power distribution networks, comprising the following steps:

[0007] Step 1: Parse the metadata of the power distribution line SVG file to extract the equipment and the connection relationships between the equipment;

[0008] Step 2: Construct an undirected graph with the connections between devices as edges, and construct subgraphs and connected subgraphs based on the original undirected graph and the target node list to form a topology graph;

[0009] Step 3: Starting from the specified root node, traverse the subgraph using the breadth-first search algorithm. Mark the level of each node according to the distance from the root node to the current node. Perform edge pruning based on the marked levels, removing edges between nodes of the same level in the subgraph. After pruning, only the connected components containing the root node are retained. Based on the level relationship, convert the undirected graph into a directed graph.

[0010] Step 4: For each switch node except the root node, disconnect its edge from its parent node, then traverse all nodes downstream of the switch node and count the number of public and private transformers; directly count the number of distribution transformers in the entire directed graph based on the root node; for each distribution transformer node, find its parent node in the directed graph and determine the type of the parent node to form a basic information table of the switch to which the distribution transformer belongs.

[0011] Step 5: For each line, perform connectivity analysis on the root nodes of other lines, merge the subgraphs corresponding to the source root node and the target root node to form a merged subgraph, calculate the shortest path between the two root nodes in the merged subgraph to obtain the detailed path of the line connection; analyze the connectivity of the two lines, but simplify the path to [source root node, common node, target root node], where the common node is the node shared by the two subgraphs to obtain the simplified path of the line connection.

[0012] Further optimization involves constructing a subgraph and a connected subgraph as follows: Initialize a subgraph containing only the target node. For each pair of target nodes, check if a path exists in the undirected graph. If it exists, add an edge to the subgraph; otherwise, do not add an edge to the subgraph. The target node and the added edge constitute a connected subgraph.

[0013] Further optimization involves the following process for edge pruning based on the marked levels: Loop through all edges in the subgraph, determine if the two nodes connected by the edge belong to the same level, and if so, remove the edge between nodes of the same level in the subgraph; after pruning, if multiple connected components are generated, expand the connected domain layer by layer through the adjacency list, traverse each edge in the graph for dynamic merging, perform a full node scan on the pruned subgraph, output multiple maximum connected subgraphs, form the basic data for topological partitioning, iterate and generate a node set in descending order of connected component size, retain only the connected components containing the root node, and retain the connected components containing the root node as the new subgraph.

[0014] Further preferred, the directed graph points from lower-level nodes to higher-level nodes.

[0015] Further optimization involves storing the edge list of the subgraph in the current file with the root node as the key after analyzing the transformer-switch relationship. This process is repeated for all lines to form a dictionary of all line subgraphs.

[0016] Further preferably, the specific process of step 4 is as follows:

[0017] For each switch node except the root node, disconnect its edge from its parent node, and then traverse all nodes downstream of the switch node. For each switch node, if the switch is the root node, count the number of all common variables and special variables in the entire directed graph. If the switch is not the root node, get its parent node, copy the directed graph, and then disconnect the edge from the parent node to the switch. Start from the switch node and perform a breadth-first search traversal, record all reachable nodes, form a new directed graph and count the number of common variables and special variables.

[0018] For each distribution transformer node, obtain its parent node in the directed graph. In the tree structure, a distribution transformer node should have only one parent node. If there is a parent node, determine the type of the parent node. If the parent node is in the switch node list, the parent node type is switch. If the parent node is in the distribution transformer node list, the parent node type is distribution transformer. Otherwise, the parent node type is other. Record the level of the parent node. If there is no parent node, mark it as no parent node and form the basic information table of the switch to which the distribution transformer belongs.

[0019] Further preferred, the specific process of step 5 is as follows: Construct a route and topology dictionary, where the key is the root node of the route and the value is the edge list of the route subgraph. For each route, perform connectivity analysis on the root nodes of other routes, merge the source route subgraph and the target route subgraph into a large graph, check whether there is a path from the source root node to the target root node in the merged large graph. If there is, obtain a shortest path and find a common node in the obtained shortest path. If not found, use the first intermediate node in the path as the common node. Store the connectivity path information of each pair of routes in a nested dictionary structure, where the outer key is the source route root node and the inner key is the target route root node, thus obtaining the detailed route connection path.

[0020] For a simplified path connecting two subgraphs, calculate the intersection of the nodes of the two subgraphs, traverse each common node, check if there is a path from the source root node to the common node, and then from the common node to the target root node. For common nodes that meet the conditions, construct a simplified path [source root node, common node, target root node]. Collect all simplified paths that meet the conditions. If there are multiple paths, only the first one is taken.

[0021] A second aspect of the present invention provides a power distribution network topology analysis system, comprising:

[0022] Metadata parsing module: used to parse the metadata of the power distribution line SVG file to extract the equipment and the connection relationships between the equipment;

[0023] Topology graph construction module: used to construct an undirected graph with the connection relationships between devices as edges, and to construct subgraphs and connected subgraphs based on the original undirected graph and the target node list to form a topology graph;

[0024] The hierarchy analysis module is used to traverse the subgraph using a breadth-first search algorithm, starting from a specified root node, and to label the hierarchy of each node based on the distance from the root node to the current node.

[0025] The pruning module is used to prune edges based on the marked level, removing edges between nodes at the same level in the subgraph; after pruning, only the connected components containing the root node are retained.

[0026] The directed graph construction module is used to convert undirected graphs into directed graphs based on hierarchical relationships;

[0027] The transformer-switcher relationship analysis module is used to disconnect the edge between each switch node (excluding the root node) and its parent node, then traverse all nodes downstream of the switch node to count the number of public and private transformers; directly count the number of transformers in the entire directed graph based on the root node; for each transformer node, find its parent node in the directed graph, determine the type of the parent node, and form a basic information table of the switch to which the transformer belongs.

[0028] The connection route analysis module is used to perform connectivity analysis on the root nodes of each route and other routes. It merges the subgraphs corresponding to the source root node and the target root node to form a merged subgraph. In the merged subgraph, the shortest path between the two root nodes is calculated to obtain the detailed connection path of the route. It also analyzes the connectivity of two routes, but the path is simplified to [source root node, common node, target root node]. The common node is the node shared by the two subgraphs to obtain the simplified connection path of the route.

[0029] The data storage module is used to store all extracted device information and the graphs or paths obtained from each step.

[0030] In a third aspect, the present invention provides an electronic device, including a memory and a processor, wherein the memory stores computer-readable instructions, and when the instructions are executed by the processor, the processor performs the aforementioned power distribution network topology analysis method.

[0031] In a fourth aspect, the present invention provides a computer-readable storage medium having a computer program stored thereon, wherein the computer program, when executed by a processor, implements the aforementioned power distribution network topology analysis method.

[0032] The beneficial effects of this invention are: by using hierarchical pruning technology to remove edges between nodes at the same level, the subgraph strictly conforms to the radial characteristics of the power distribution network, avoiding analysis errors caused by ring structures, and laying a reliable foundation for subsequent topology calculations.

[0033] The system automatically counts the number of public and private transformers downstream of each switch, clarifies the hierarchical relationship between distribution transformers and parent nodes (switches / transformers), and forms a structured table of basic information about the switches to which the distribution transformers belong, thus avoiding omissions and errors caused by manual statistics.

[0034] A breadth-first search (BFS) algorithm is used to implement node-level labeling and path traversal. Combined with graph merging and shortest path algorithms, the analysis of line connections is transformed from manual, line-by-line verification to automated calculation. Detailed line connections provide a complete sequence of nodes, while simplified line connections are represented by common nodes. This satisfies the needs of in-depth analysis and facilitates the rapid location of key connection points, providing intuitive reference for dispatchers in handling scenarios such as fault transfer and load adjustment. Attached Figure Description

[0035] Figure 1 This is a flowchart of the power distribution network topology analysis method of the present invention. Detailed Implementation

[0036] The present invention will be further described below with reference to the embodiments. It should be noted that the following embodiments are only used to further illustrate the present invention and should not be construed as limiting the scope of protection of the present invention. Some non-essential improvements and adjustments made by those skilled in the art based on the above-described invention are still within the scope of protection of the present invention.

[0037] like Figure 1 As shown, the first embodiment of the present invention provides a power distribution network topology analysis method, the steps of which are as follows:

[0038] Step 1: Metadata Parsing: Parse the metadata of the power distribution line SVG file to extract equipment (such as switches, busbars, transformers, etc.) and the connection relationships between them. For example, extract the ID and type code of the equipment, where the type code is used to distinguish the equipment type (such as switches, transformers, etc.); extract the name mapping relationship of equipment such as circuit breakers and busbars (such as the mapping from circuit breaker ID to name); obtain the connection relationships between equipment by parsing the metadata tags of the power distribution line SVG file.

[0039] Step 2, Topology Graph Construction: Construct an undirected graph using the connections between devices as edges. Based on the original undirected graph and the list of target nodes (such as all switch nodes), initialize a subgraph containing only target nodes. Then, for each pair of target nodes, check if a path exists in the undirected graph (allowing passage through non-target nodes). If it exists, add an edge to the subgraph; otherwise, do not add an edge. The target nodes and the added edges form a connected subgraph, thus obtaining the final subgraph, connected subgraph, and undirected graph, which together form the topology graph. When constructing the subgraph, specific devices (such as switches and transformers) are filtered by type codes. For example, the type codes for switches are '11100000', '30500000', '0305', and '0111', while the type codes for distribution transformers are '0110', '11000000', '11000001' (public transformers) and '30200003', '30200002', and '30200001' (private transformers).

[0040] Step 3, Hierarchical Analysis:

[0041] Starting from the specified root node (such as the feeder outlet switch), use BFS (Breadth-First Search) to traverse the subgraph and mark the level (distance from the root node to the current node) for each node.

[0042] Edge pruning is performed based on the marked levels: All edges in the subgraph are iterated, and it is determined whether the two nodes connected by the edge belong to the same level. If so, the edges between nodes of the same level in the subgraph are removed (because power distribution networks are usually tree-like or radial, nodes of the same level should not be directly connected). After pruning, multiple connected components may be generated. The connected domain is expanded layer by layer through the adjacency list. Each edge in the graph is traversed and dynamically merged. A full node scan is performed on the pruned subgraph, and multiple maximum connected subgraphs are output to form the basic data for topology partitioning. Node sets are generated iteratively in descending order of connected component size, retaining only the connected components containing the root node, and retaining the connected components containing the root node as new subgraphs.

[0043] The new subgraph is converted into a directed graph based on the hierarchical relationship: from the node of the lower level to the node of the higher level (i.e. from the power supply side to the load side).

[0044] Step 4: Analysis of the relationship between the distribution transformer and the switch:

[0045] For each switch node (except the root node), disconnect its edge from its parent node. Then, traverse all nodes downstream of the switch node. For each switch node, if the switch is the root node, count the number of all common variables and special variables in the entire directed graph. If the switch is not the root node, obtain its parent node (direct predecessor; assuming there is only one parent node, take the first one). Copy the directed graph (to avoid modifying the original graph). Then, disconnect the edge from the parent node to the switch. Start BFS traversal from the switch node, record all reachable nodes (i.e., the subgraph downstream of the switch), form a new directed graph, and count the number of common variables and special variables.

[0046] For each distribution transformer node, obtain its direct predecessor node (parent node) in the directed graph. In the tree structure, each distribution transformer node should have only one parent node. If there is a parent node, determine its type: if the parent node is in the switch node list, its type is switch; if it is in the distribution transformer node list, its type is distribution transformer; otherwise, its type is other. Record the parent node's level (obtained from the level dictionary). If there is no parent node, mark it as having no parent node. Create a basic information table of the switch to which the distribution transformer belongs.

[0047] Furthermore, after analyzing the transformer-switch relationship, the edge list of the current file's subgraph (switch subgraph) is stored with the root node as the key. This process is repeated for all lines to form a dictionary of all line subgraphs.

[0048] Step 5, Connection Path Analysis: Construct a path and topology dictionary, where the key is the root node of the path (representing the path), and the value is the edge list of the path's subgraph. For each path (represented by the root node), perform connectivity analysis with the root nodes of other paths. For each pair of paths (the source and target paths are different), merge the source and target path subgraphs into a larger graph. Check if a path from the source root node to the target root node exists in the merged graph. If it exists, obtain a shortest path (here, a list of nodes is obtained). Find a common node in the obtained shortest path (this node must belong to both the source and target path subgraphs). If not found, use the first intermediate node in the path (i.e., the node with index 1) as the common node. Store the connectivity path information of each pair of paths (including the complete path and the common node) in a nested dictionary structure, with the outer key being the source path root node and the inner key being the target path root node, thus obtaining the detailed path of the path connections.

[0049] For a simplified path connecting two subgraphs, calculate the intersection of the nodes (i.e., the set of common nodes), traverse each common node, check if there is a path from the source root node to the common node, and then from the common node to the target root node. For common nodes that meet the conditions, construct a simplified path [source root node, common node, target root node], collect all simplified paths that meet the conditions, and if there are multiple paths, only take the first one.

[0050] Furthermore, the basic information of the switch, the transformer connected to the switch, the switch to which the transformer belongs, the detailed path of the line connection, and the simplified path of the line connection are stored for subsequent advanced applications such as distribution network fault location and load transfer.

[0051] The method of this invention can automatically extract topology relationships from a large number of SVG format power distribution networks, and complete the statistics of the number of distribution transformers connected to switches, the analysis of the switches to which the distribution transformers belong, and the analysis of line connection relationships, providing data support for the operation and planning of power distribution networks.

[0052] (1) Improved file processing efficiency. The parallel memory computing architecture is adopted and the graph computing engine is used to realize the topological relationship parsing in seconds. The processing time of 1200 SVG drawings is reduced from 600 hours to 1 hour, and the single-line analysis response speed is increased by 40 times (30 minutes to 45 seconds).

[0053] (2) The topology relationship recognition accuracy is >99.2%. The topology loop detection algorithm (loop recognition based on DFS) and the intelligent error correction of device type code (automatically correcting format differences such as 0305 to 30500000) are adopted to automatically identify and repair 23 common SVG annotation errors.

[0054] (3) Supports cross-line topology mining, cross-regional analysis based on connected components and intelligent identification of grid island operation, can realize full-domain line connection relationship analysis, automatically identify backup power supply paths under N-1 conditions, and discover 32 potential connection optimization points in actual application.

[0055] A second embodiment of the present invention provides a power distribution network topology analysis system, comprising:

[0056] Metadata parsing module: used to parse the metadata of the power distribution line SVG file to extract the equipment and the connection relationships between the equipment;

[0057] Topology graph construction module: used to construct an undirected graph with the connection relationships between devices as edges, and to construct subgraphs and connected subgraphs based on the original undirected graph and the target node list to form a topology graph;

[0058] The hierarchy analysis module is used to traverse the subgraph using a breadth-first search algorithm, starting from a specified root node, and to label the hierarchy of each node based on the distance from the root node to the current node.

[0059] The pruning module is used to prune edges based on the marked level, removing edges between nodes at the same level in the subgraph; after pruning, only the connected components containing the root node are retained.

[0060] The directed graph construction module is used to convert undirected graphs into directed graphs based on hierarchical relationships;

[0061] The transformer-switcher relationship analysis module is used to disconnect the edge between each switch node (excluding the root node) and its parent node, then traverse all nodes downstream of the switch node to count the number of public and private transformers; directly count the number of transformers in the entire directed graph based on the root node; for each transformer node, find its parent node in the directed graph, determine the type of the parent node, and form a basic information table of the switch to which the transformer belongs.

[0062] The connection route analysis module is used to perform connectivity analysis on the root nodes of each route and other routes. It merges the subgraphs corresponding to the source root node and the target root node to form a merged subgraph. In the merged subgraph, the shortest path between the two root nodes is calculated to obtain the detailed connection path of the route. It also analyzes the connectivity of two routes, but the path is simplified to [source root node, common node, target root node]. The common node is the node shared by the two subgraphs to obtain the simplified connection path of the route.

[0063] The data storage module is used to store all extracted device information and the graphs or paths obtained from each step.

[0064] A third embodiment of the present invention provides an electronic device, including a memory and a processor. The memory stores computer-readable instructions, which, when executed by the processor, cause the processor to implement the power distribution network topology analysis method described in the first embodiment.

[0065] A fourth embodiment of the present invention provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the power distribution network topology analysis method described in the first embodiment.

[0066] The above description merely illustrates preferred embodiments of the present invention and is not intended to limit the invention in any other way. Any person skilled in the art may make modifications or alterations to the above-disclosed content to create equivalent embodiments. However, any simple modifications, equivalent changes, and alterations made to the above embodiments based on the technical essence of the present invention, without departing from the scope of the present invention, shall still fall within the protection scope of the present invention.

Claims

1. A method for topology analysis of power distribution networks, characterized by the following steps: as follows: Step 1: Parse the metadata of the power distribution line SVG file to extract the equipment and the connection relationships between the equipment; Step 2: Construct an undirected graph with the connections between devices as edges, and construct subgraphs and connected subgraphs based on the original undirected graph and the target node list to form a topology graph; Step 3: Starting from the specified root node, traverse the subgraph using the breadth-first search algorithm, and label the level of each node according to the distance from the root node to the current node; Edge pruning is performed based on the marked level, removing edges between nodes at the same level in the subgraph; After pruning, only the connected components containing the root node are retained; Based on the hierarchical relationship, convert the undirected graph into a directed graph; Step 4: For each switch node except the root node, disconnect its edge from its parent node, then traverse all nodes downstream of the switch node and count the number of public and private transformers; directly count the number of distribution transformers in the entire directed graph based on the root node; for each distribution transformer node, find its parent node in the directed graph and determine the type of the parent node to form a basic information table of the switch to which the distribution transformer belongs. Step 5: For each line, perform connectivity analysis on the root nodes of other lines, merge the subgraphs corresponding to the source root node and the target root node to form a merged subgraph, calculate the shortest path between the two root nodes in the merged subgraph to obtain the detailed path of the line connection; analyze the connectivity of the two lines, but simplify the path to [source root node, common node, target root node], where the common node is the node shared by the two subgraphs to obtain the simplified path of the line connection. The specific process of step 4 is as follows: For each switch node except the root node, disconnect its edge from its parent node, and then traverse all nodes downstream of the switch node. For each switch node, if the switch is the root node, count the number of all common variables and special variables in the entire directed graph. If the switch is not the root node, get its parent node, copy the directed graph, and then disconnect the edge from the parent node to the switch. Start from the switch node and perform a breadth-first search traversal, record all reachable nodes, form a new directed graph and count the number of common variables and special variables. For each distribution transformer node, obtain its parent node in the directed graph. In the tree structure, a distribution transformer node should have only one parent node. If there is a parent node, determine the type of the parent node. If the parent node is in the switch node list, the parent node type is switch. If the parent node is in the distribution transformer node list, the parent node type is distribution transformer. Otherwise, the parent node type is other. Record the level of the parent node. If there is no parent node, mark it as no parent node and form the basic information table of the switch to which the distribution transformer belongs.

2. The power distribution network topology analysis method according to claim 1, characterized in that, The process of constructing a subgraph and a connected subgraph is as follows: Initialize a subgraph containing only the target node. For each pair of target nodes, check if there is a path in the undirected graph. If there is, add an edge to the subgraph. If there is no path, do not add an edge to the subgraph. The target node and the added edge constitute a connected subgraph.

3. The power distribution network topology analysis method according to claim 1, characterized in that, The process of edge pruning based on the marked level is as follows: loop through all edges of the subgraph, determine whether the two nodes connected by the edge belong to the same level, if so, remove the edge between nodes of the same level in the subgraph; after pruning, if multiple connected components are generated, expand the connected domain layer by layer through the adjacency list, traverse each edge in the graph to perform dynamic merging operation, perform a full node scan on the pruned subgraph, output multiple maximum connected subgraphs, form the basic data for topological partitioning, iterate to generate a node set in descending order of connected component size, retain only the connected component containing the root node, and retain the connected component containing the root node as the new subgraph.

4. The power distribution network topology analysis method according to claim 1, characterized in that, The directed graph points from lower-level nodes to higher-level nodes.

5. The power distribution network topology analysis method according to claim 1, characterized in that, After analyzing the transformer-switch relationship, the edge list of the subgraph in the current file is stored with the root node as the key. This process is repeated for all lines to form a dictionary of all line subgraphs.

6. The power distribution network topology analysis method according to claim 1, characterized in that, The specific process of step 5 is as follows: Construct a route and topology dictionary, where the key is the root node of the route and the value is the edge list of the route subgraph. For each route, perform connectivity analysis on the root nodes of other routes. Merge the source route subgraph and the target route subgraph into a large graph. Check whether there is a path from the source root node to the target root node in the merged large graph. If there is, obtain a shortest path and find a common node in the obtained shortest path. If not found, use the first intermediate node in the path as the common node. Store the connectivity path information of each pair of routes in a nested dictionary structure, where the outer key is the root node of the source route and the inner key is the root node of the target route, thus obtaining the detailed route connection path. For a simplified path connecting two subgraphs, calculate the intersection of the nodes of the two subgraphs, traverse each common node, check if there is a path from the source root node to the common node, and then from the common node to the target root node. For common nodes that meet the conditions, construct a simplified path [source root node, common node, target root node]. Collect all simplified paths that meet the conditions. If there are multiple paths, only the first one is taken.

7. A power distribution network topology analysis system, used to execute the power distribution network topology analysis method as described in any one of claims 1 to 6, characterized in that, include: Metadata parsing module: used to parse the metadata of the power distribution line SVG file to extract the equipment and the connection relationships between the equipment; Topology graph construction module: used to construct an undirected graph with the connection relationships between devices as edges, and to construct subgraphs and connected subgraphs based on the original undirected graph and the target node list to form a topology graph; The hierarchy analysis module is used to traverse the subgraph using a breadth-first search algorithm, starting from a specified root node, and to label the hierarchy of each node based on the distance from the root node to the current node. The pruning module is used to prune edges based on the marked level, removing edges between nodes at the same level in the subgraph; After pruning, only the connected components containing the root node are retained; The directed graph construction module is used to convert undirected graphs into directed graphs based on hierarchical relationships; The transformer-switcher relationship analysis module is used to disconnect the edge between each switch node (excluding the root node) and its parent node, then traverse all nodes downstream of the switch node to count the number of public and private transformers; directly count the number of transformers in the entire directed graph based on the root node; for each transformer node, find its parent node in the directed graph, determine the type of the parent node, and form a basic information table of the switch to which the transformer belongs. The connection route analysis module is used to perform connectivity analysis on the root nodes of each route and other routes. It merges the subgraphs corresponding to the source root node and the target root node to form a merged subgraph. In the merged subgraph, the shortest path between the two root nodes is calculated to obtain the detailed connection path of the route. It also analyzes the connectivity of two routes, but the path is simplified to [source root node, common node, target root node]. The common node is the node shared by the two subgraphs to obtain the simplified connection path of the route. The data storage module is used to store all extracted device information and the graphs or paths obtained from each step.

8. An electronic device comprising a memory and a processor, wherein the memory stores computer-readable instructions, characterized in that, When the instruction is executed by the processor, the processor performs the power distribution network topology analysis method according to any one of claims 1-6.

9. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by the processor, it implements the power distribution network topology analysis method according to any one of claims 1-6.

Images